刘峰六的博客园

摘要： 5.4.2 Step 2: Insert Following the search loop, q is the last non-null node examined, so it is the parent of the node to be inserted. The code below creates and initializes a new node as a child of q ... 阅读全文

摘要： 5.4.1 Step 1: Search The search step is an extended version of the corresponding code for BST insertion in <BST item insertion function 32>. The earlier code had only two variables to maintain: ... 阅读全文

摘要： 5.4 Insertion The insertion function for unbalanced BSTs does not maintain the AVL balancing rule, so we have to write a new insertion function. But before we get into the nitty-gritty details, let's ... 阅读全文

摘要： 5.3 Operations Now we'll implement for AVL trees all the operations that we did for BSTs. Here's the outline. Creation and search of AVL trees is exactly like that for plain BSTs, and the generic tabl... 阅读全文

摘要： 5.2 Data Types We need to define data types for AVL trees like we did for BSTs. AVL tree nodes contain all the fields that a BST node does, plus a field recording its balance factor: This code is incl... 阅读全文

摘要： 5.1.1 Analysis How good is the AVL balancing rule? That is, before we consider how much complication it adds to BST operations, what does this balancing rule guarantee about performance? This is a sim... 阅读全文

摘要： 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... 阅读全文

摘要： 5 AVL Trees In the last chapter, we designed and implemented a table ADT using binary search trees. We were interested in binary trees from the beginning because of their promise of speed compared to ... 阅读全文