Category:Balanced tree

From LiteratePrograms
Jump to: navigation, search

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.


This category has the following 3 subcategories, out of 3 total.