Balancing Rule
摘要:
5.1 Balancing Rule A binary search tree is an AVL tree if the difference in height between the subtrees of each of its nodes is between -1 and +1. Said another way, a BST is an AVL tree if it is an em... 阅读全文
posted @ 2010-10-04 13:26 sohu2000000 阅读(133) 评论(0) 推荐(1) 编辑