Red-Black Tree: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

11 September 2014

  • curprev 12:3112:31, 11 September 2014‎ 130.83.109.100 talk‎ 203 bytes +203‎ 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..."
Retrieved from "https://wiki.algo.informatik.tu-darmstadt.de/Red-Black_Tree"