Red-Black Tree: Difference between revisions
Jump to navigation
Jump to search
(Created page with "Every node is either red or black. The root is black. The leaves are black. A red node has only black child nodes. If there is a node <math>x</math>, then all nodes from x to...") |
(No difference)
|
Revision as of 12:31, 11 September 2014
Every node is either red or black. The root is black. The leaves are black. A red node has only black child nodes. If there is a node [math]\displaystyle{ x }[/math], then all nodes from x to a leaf have the same height.