完全二叉树（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 · 1195 阅读 · 0 评论 -
pat甲1110. Complete Binary Tree（完全二叉树）
1110. Complete Binary Tree (25) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue Given a tree, you are supposed to tel原创 2016-12-09 20:28:10 · 340 阅读 · 0 评论