完全二叉树(complete binarry tree)
文章平均质量分 90
ninesun127
有一个目标,总能让我们欢欣鼓舞~
展开
-
pat甲1123. Is It a Complete AVL Tree (AVL树+层次遍历+完全二叉树)
pat advanced level 1123. Is It a Complete AVL Tree (30)pat甲1123. Is It a Complete AVL Tree An AVL tree is a self-balancing 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 a原创 2016-12-13 17:22:03 · 1165 阅读 · 0 评论 -
pat甲1110. Complete Binary Tree(完全二叉树)
1110. Complete Binary Tree (25)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueGiven a tree, you are supposed to tel原创 2016-12-09 20:28:10 · 281 阅读 · 0 评论