
ETreeException

Base exception class for tree ( GTree.TGCustomTree) exceptions.


TGBinaryTree

Defines a binary tree structure where each node can have only two children.


TGBinaryTreeNode

Defines a tree node with two (and only two) children..


TGCustomTree

Defines a tree class, which simulates a hierarchical tree structure, with a root value and subtrees of children with a parent node, represented as a set of linked nodes.
A tree data structure can be defined recursively (locally) as a collection of nodes (starting at a root node), where each node is a data structure consisting of a value, together with a list of references to nodes (the "children"), with the constraints that no reference is duplicated, and none points to the root.


TGCustomTreeNode

Defines the base class for nodes in a tree.
Each node in a tree stores an Item and tracks its child nodes.


TGHeightBalancedTree

Defines a heightbalanced binary tree structure.
A selfbalancing (or heightbalanced) binary search tree is any nodebased 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.
Warning

The TGHeightBalancedTree class is not completely implemented.



TGHeightBalancedTreeNode

Defines a binary tree node with a height balance.
A selfbalancing (or heightbalanced) binary search tree is any nodebased 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.
Warning

The TGHeightBalancedTree class is not completely implemented.

Note

The height balanced tree maintains the BalanceFactor property.



TGTree

Defines a tree class, which simulates a hierarchical tree structure, with a root value and subtrees of children with a parent node, represented as a set of linked nodes.
A tree data structure can be defined recursively (locally) as a collection of nodes (starting at a root node), where each node is a data structure consisting of a value, together with a list of references to nodes (the "children"), with the constraints that no reference is duplicated, and none points to the root.


TGTreeNode

Defines a tree node that can have an arbitrary number of children.
Each node in a tree stores an Item and tracks its child nodes.
