| http://www.w3.org/ns/prov#value | - Since operations such as inserting, deleting, and finding values requires 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.To see why these properties guarantee this, it suffices to note that no path can have two red nodes in a row, due to property 4.
|
