|
Add(TRSTreeItem,Integer)
|
Overloaded. Adds a new node with the specified Item and Priority to the tree. The new node is returned.
The node will be inserted into the tree in order to keep the priority order. The tree will be rebalanced as needed.
|
|
Add(TRSTreeItem,Integer,TGHeightBalancedTreeNode)
|
Overloaded. Adds a new node with the specified Item and Priority to the subtree specified by ANode. The new node is returned.
The node will be inserted into the subtree in order to keep the priority order. The tree will be rebalanced as needed.
|
|
Delete(TRSTreeItem,Integer)
|
Overloaded. Delete node with the specified Item and Priority from the tree.
|
|
Delete(TRSTreeItem,Integer,TGHeightBalancedTreeNode)
|
Overloaded. Delete node with the specified Item and Priority from the subtree specified by ANode.
|
|
FindNode(TGHeightBalancedTreeNode,Integer,TRSTreeItem)
|
Finds a node that matches the item and priority. If not found, result is nil.
|
|
NewNode(Integer)
|
Overloaded. Creates a new node with the specified priority. The node is not attached to the tree.
|
|
Rebalance(TGHeightBalancedTreeNode,TGHeightBalancedTreeNode,TGHeightBalancedTreeNode,TGHeightBalancedTreeNode,Integer)
|
Rebalance the tree.
Adjust balance factors on nodes from recent potential unbalanced node to last node. By definition, recent node was set to the last unbalanced node so all the nodes between it and Last node have BalanceFactor of 0 and will change to +/- 1.
|
