InorderBbstIterator
Short summary
This class implements in order iteration strategy (sorted) for balanced binary search trees.
| Access | Abstract | Final | Extends | Implements |
|---|---|---|---|---|
| - | No | No | AbstractBalancedBinarySearchTreeIterator | - |
UML Diagram
Properties
className
Type: CNM_AbstractObject.ClassName
Methods
fillNodeListUntilLeftMost
- Parameters:
startNode(CNM_CollectionInterfaces.IBinaryTreeNode)
- Return type:
VOID
Searches the smallest childnode starting with the given node.…
getNextTreeNode
- Return type:
BOOL
Gets the next node that iterate should process.…
getStartNode
- Return type: CNM_CollectionInterfaces.IBinaryTreeNode
This method is called to retrive the first node of the iteration.…
processNode
- Parameters:
nodeToProcess(CNM_CollectionInterfaces.IBinaryTreeNode)
- Return type:
VOID
This method appends (if they exists) the left and right child of the node to the nodelist.…
Code
Declaration
{attribute 'enable_dynamic_creation'}
FUNCTION_BLOCK InorderBbstIterator EXTENDS AbstractBalancedBinarySearchTreeIterator