RiverSoftAVG Products Help

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 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.

TGHeightBalancedTreeNode

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.

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.

TPriorityOrder

Sort order for priority

TTraversalOrder

Traversal order for processing tree nodes

TTreeIterator

Method signature for modifying a tree node.

TBalanceFactor

Represents type TBalanceFactor.

TRSTreeItem

Type of the item to store in the tree nodes

TTreeNodeClass

Represents type TTreeNodeClass.

TreeInvalidIndex

'Invalid Index'

TreeMismatchedOwner

'Owner of Node does not match Self'

TreeNodeCapacityError

'Cannot add any more children to node'

TreeNodeTypeChange

'Cannot change node types while any nodes exist'

TreeNodeUnknownError

'Unknown Tree Node'