| http://www.w3.org/ns/prov#value | - Since operations such as inserting, deleting, and finding values require worst-case time proportional to the height of the tree, this theoretical upper bound on the height allows red???black trees to be efficient in the worst case, unlike ordinary binary search trees.
|
