Show/Hide Toolbars

RiverSoftAVG Products Help

Navigation: Code Documentation > RSCommon > GTree > Classes

TGHeightBalancedTree Class

Scroll Prev Top Next More

Defines a height-balanced binary tree structure.

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

These structures provide efficient implementations for mutable ordered lists, and can be used for other abstract data structures such as associative arrays, priority queues and sets.

alert_cautionWarning

The TGHeightBalancedTree class is not completely implemented.

Namespace: GTree

RiverSoftAVG Products Help © 1996-2016 Thomas G. Grubb