7.4比较树（7.4 more trees）.doc

7.4比较树（7.4 more trees） Comparison of tree algorithm (also called decision tree or search tree), the method is that the tracking algorithm, using the tree node (we use the circle to represent) to describe each key comparison. In the circle, we place the index of the keys used to compare the target key. The branch (line) is drawn down by the position of the circle, indicating the result of the comparison, and then marked as before. When the algorithm is finished, we place the no or the location of the target key on the right branch. We call it leaf and square it. Ye Youshi is also known as the tail node or outer node of a tree. The remaining nodes are called the inner nodes of the tree. The comparison tree of sequential lookup is especially simple, and it is drawn in figure 7.2. The number of times a particular lookup algorithm performs is the number of nodes that are traversed inside the path from the top of the tree (we call it root) to the path of an appropriate leaf. The number of branches traversed from a root node to a node is called the height of the node. Therefore, the root node has a height of 0, and the node immediately below it is 1, and so on. The total number of nodes in the longest path of a tree is called the height of a tree. Thus, the height of a tree with only 1 nodes is 1. In the later chapters, we sometimes encounter empty trees, that is, there is no node in the tree. We use the following rule, that is, the height of the empty tree is 0. In order to complete our tree in the use of terminology, traditionally, we use the family tree to describe the biology of trees: we immediately below the tube node of the V node called V node, the parent node node V above immediately called V . Therefore, we can call it leaf parents or root children in an image. 7.4.1 analyzes trees at n=10 The shape of the 1. tree On average, the number of times in which each sequential lookup should be done is far more than two. This is clearly reflected in the comparison of the