Data Structure Review 4 tree

1. Two Fork search tree

Characteristics:

1. Each element has a key, and each element must have a different key.

2. The key < root of the left subtree, the key> root of the right sub-tree.

3. The subtree still satisfies the conditions.

Indexed binary search tree: The field with Leftsize on the left side indicates the number of left-side nodes +1.

Insert: Compare the key of the inserted node and the root node in turn

Delete: 1.leaf2. Only one end has a node node3. Node deletion node with nodes at both ends is replaced with the smallest left or right end.

The height of the tree determines the degree of responsibility for the insertion, and the optimal height is the log2 base N.

2. Balance Search binary Tree AVL tree

1. is a binary search tree. 2.| Height difference between left and right side of hl-hr| <=1;

Data Structure Review 4 tree