Data structure - red black tree

1. What is red black tree? The red black tree is first a self balanced binary search tree. The height difference between the left and right subtrees may be greater than 1, so the red black tree is not strictly balanced binary tree (AVL), but the cost of balancing it is low, and its average statistical performance is better than AVL. It has the ...

Posted by sirTemplar on Fri, 15 Oct 2021 14:31:28 -0700

Tree and binary tree [data structure]

tree structure Our previous studies are basically one-to-one problems, and the tree is a nonlinear data structure, which is a finite set with hierarchical relationship composed of n(n ≥ 0) nodes characteristic: When n=0, it is called an empty tree. In any non empty tree: There is and only one root nodeWhen n > 1, the other nodes ca ...

Posted by Deviants on Thu, 07 Oct 2021 16:01:24 -0700