2015年4月13日
Complete Binary Search Tree
摘要： A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties:The left subtree of a node contains only nodes w... 阅读全文
posted @ 2015-04-13 17:20 lkyssd 阅读(165) 评论(0) 推荐(0)
Search in a Binary Search Tree
摘要： To search a key in a binary search tree, we start from the root and move all the way down, choosing branches according to the comparison results of th... 阅读全文
posted @ 2015-04-13 17:12 lkyssd 阅读(253) 评论(0) 推荐(0)
Root of AVL Tree
摘要： 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 @ 2015-04-13 17:07 lkyssd 阅读(140) 评论(0) 推荐(0)