BALANCEDTREES

The balancedtrees unit contains the class definition for TBalancedStringTree. A binary tree is balanced if for each node it holds that the number of inner nodes in the left subtree and the number of inner nodes in the right subtree differ by at most 1.

Think of a balanced tree as a high-speed memory indexer. It is not designed to save and load, however, during run-time you can store information and test if it exists lightning fast.

Globals

Functions

Procedures

TBalancedStringTree

.Init()
.IsEmpty:Boolean
.Insert(V:String):Boolean
.Delete(V:String)
.Exists(V:String):Boolean
.Free()