One of TreeMap source analysis-sort binary tree, balanced binary tree, red and black tree

First, sort binary tree (BST tree)

1. The definition of the sort binary tree

Sort binary tree, binary sort tree

The sort binary tree is either an empty binary tree or a two-fork tree with the following properties:

(1) If its left subtree is not empty, then the value of all nodes on the left subtree is less than the value of its root node;
(2) if its right subtree is not empty, then the value of all nodes on the right subtree is greater than the value of its root node;
(3) Its left and right sub-trees are also sorted binary trees respectively.

By traversing the ordered binary tree in the middle order, the ordered sequence can be obtained from small to large.

Like what

2. Sorting binary tree Insert and delete

Second, balanced binary tree (Balanced binary Tree,avl tree)

Three, red and black trees ()

One of TreeMap source analysis-sort binary tree, balanced binary tree, red and black tree