yo_bc的博客

PAT (Advanced Level) Practise1124 Raffle for Weibo Followers (20)1125 Chain the Ropes (25)1126 Eulerian Path (25)1127 ZigZagging on a Tree (30)

主要是要理解红黑树的定义：There is a kind of balanced binary search tree named red-black tree in the data structure. It has the following 5 properties:(1) Every node is either red or black.(2) The root is bl

题意：给定一颗二叉搜索树的前序序列，然后给定两点u, v，寻找其LCA。思路：最直接的思路就是建树，然后寻找Lca，可以发现对于BST上的当前节点，如果其key小于两点u,v中较小的，则u和v的Lca必定会在当前节点的右子树上；如果其key大于两点u,v中较大的，则u和v的Lca必定会在当前节点的左子树上。所以这种想法可以很容易实现并且具有较好的复杂度。但是交题只能过前两组测试点，后三