Category:Balanced Trees

A balanced trees, or self-balancing (or height-balanced) binary search tree in computer science, is any node-based binary search tree that automatically keeps its height (number of levels below the root) small in the face of arbitrary item insertions and deletions

Subcategories

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

A

B

R

Media in category "Balanced Trees"

Last modified on 28 November 2013, at 19:12