摘要: 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 阅读全文
posted @ 2018-07-14 21:47 王清河 阅读(236) 评论(0) 推荐(0) 编辑