摘要: 平衡二叉树 LL RR LR RL 注意画图理解法 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 阅读全文
posted @ 2016-03-25 23:56 kuotian 阅读(395) 评论(0) 推荐(0) 编辑