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
原创
2017-10-02 09:43:19 ·
164 阅读 ·
0 评论