7.4比较树(国外英语资料).docVIP

7.4比较树(国外英语资料) (also called decision tree algorithm of tree or search trees), the method is that the tracking algorithm, using tree nodes (we use the circle) to describe each key comparison. In the loop we place the index of the keys that are compared to 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 over, we place the no or the target key in the appropriate branch. Were going to call it the leaf, in square. The leaf is sometimes called the tail or outer node of the tree. T