ian wrote:
I remember it being easy to use this in a database since it makes it possible to get (for example) all descendents or all children in a single query, something not always possible with other algorithms. I
Does this help? http://en.wikipedia.org/wiki/Self-balancing_binary_search_tree
