The book 2-3 search trees are introduced first, and then introduces the red-black tree, get the definition and most of the books of different the red-black tree, which improve the 2-3 tree, 3 - nodes represent as a left oblique red links connected to two 2 - node, concrete are defined as follows:
1. The red links are links to the left
2. No connected to a node at the same time and two red link
3. Any empty link to the same number of black links on the path to the root node

Including 2 or 3 easy to understand, can and the red-black tree define the corresponding, but why did the first red link can only be left link, I feel there is a right red links don't affect the time complexity of the red-black tree, please

CodePudding user response:

To ask, I understand?