Search results
Results from the WOW.Com Content Network
In computer science, a red–black tree is a self-balancing binary search tree data structure noted for fast storage and retrieval of ordered information. The nodes in a red-black tree hold an extra "color" bit, often drawn as red and black, which help ensure that the tree is always approximately balanced.
AA trees are named after their originator, Swedish computer scientist Arne Andersson. [1] AA trees are a variation of the red–black tree, a form of binary search tree which supports efficient addition and deletion of entries. Unlike red–black trees, red nodes on an AA tree can only be added as a right subchild.
You are free: to share – to copy, distribute and transmit the work; to remix – to adapt the work; Under the following conditions: attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made.
I am tempted to remove some of the "See also" links. AA trees are a variation of the red-black tree, AVL and B-trees are discussed in the article, but scapegoat trees, splay trees, and T-trees are not. The article about scapegoat trees mentions red-black trees, but the connection is weak. The other two don't refer to red-black trees at all.
A left-leaning red-black tree satisfies all the properties of a red-black tree: Every node is either red or black. A NIL node is considered black. A red node does not have a red child. Every path from a given node to any of its descendant NIL nodes goes through the same number of black nodes. The root is black (by convention).
Main page; Contents; Current events; Random article; About Wikipedia; Contact us; Pages for logged out editors learn more
Main page; Contents; Current events; Random article; About Wikipedia; Contact us
What links here; Upload file; Special pages; Printable version; Page information