【PAT甲级】1066 Root of AVL Tree(25 分)(AVL数)
题目链接
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, rebalanci...
原创
2018-08-30 23:14:49 ·
492 阅读 ·
0 评论