Science Fair Project Encyclopedia
AA tree
An AA tree in combinatorics is a red-black tree with one additional rule. Differently from red-black trees, AA trees can only have a RED node as a right subchild.
Last updated: 05-26-2005 22:47:21
10-26-2009 08:16:03
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details


