树
tiantangrenjian
这个作者很懒,什么都没留下…
展开
-
【PAT】1066. Root of AVL Tree (25)
An AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is原创 2013-10-20 21:48:44 · 4044 阅读 · 0 评论 -
【PAT1004】Counting Leaves
1004. Counting Leaves (30)时间限制400 ms内存限制32000 kB代码长度限制16000 B判题程序Standard作者原创 2011-10-02 18:47:21 · 6614 阅读 · 3 评论