Red-Black Tree

From Algowiki
Revision as of 12:31, 11 September 2014 by 130.83.109.100 (talk)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search
  • 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.