Red-Black Tree is a self-balancing Binary Search Tree (BST) where every node follows following rules.1) Every node has a color either red or black.2) Root of tree is always black.3) There are no two adjacent red nodes (A red node cannot have a red parent or red child).4) Every path from a node (including root) to any of its descendant NULL node has the same number of black nodes. - Study24x7
Social learning Network
26 Mar 2019 10:06 AM study24x7 study24x7

Red-Black Tree is a self-balancing Binary Search Tree (BST) where every node follows following rules.
1) Every node has a color either red or black.2) Root of tree is always black.
3) There are no two adjacent red nodes (A red node cannot have a red parent or...

See more

study24x7
Write a comment
Related Questions
500+   more Questions to answer
Most Related Articles