Category:Balanced tree

From LiteratePrograms

A balanced tree, in the sense we use it here, is a binary search tree where the operations are modified to ensure that the tree height is low (usually O(log n)) at all times (or on average). There are several, often complex implementations of balanced trees.

Subcategories

There are 3 subcategories to this category.

A

• AVL tree

R

• Red-black tree

S

• Splay tree

Articles in category "Balanced tree"

There are 0 articles in this category.