Show/Hide Toolbars

RiverSoftAVG Products Help

Navigation: Code Documentation > RSCommon > GTree > Classes

TGHeightBalancedTreeNode Class

Scroll Prev Top Next More

Defines a binary tree node with a height balance.

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.


The TGHeightBalancedTree class is not completely implemented.


The height balanced tree maintains the    BalanceFactor property.

Namespace: GTree

RiverSoftAVG Products Help © 1996-2016 Thomas G. Grubb