Provides a nlog(n) iterator for AbstractBinaryTree.
More...
#include <vdkbtrees.h>
Detailed Description
template<class T, class Node>
class AbstractBinaryTree< T, Node >::Iterator
Provides a nlog(n) iterator for AbstractBinaryTree.
Iterator is implementes as a member of AbstractBinaryTree rather than an external object.
Constructor & Destructor Documentation
template<class T, class Node>
ructor
- Parameters
-
tree | tree reference |
start | where the iterator starts, can be:
- BtMinKey from lowest key
- BtRootKey from the tree root
- BtMaxKey from the highest key
|
template<class T, class Node>
Member Function Documentation
template<class T, class Node>
Dereferencing operator returns the object of the node currently pointed to by the iterator.
template<class T, class Node>
Move iterator to next key
template<class T, class Node>
returns a pointer to the object of the node currently pointed to (as opposed to returning a copy of the node, as the dereferencing operator does).
template<class T, class Node>
Returns o if iterator points a non valid node. ie: was moved behind the lowest/highest key
template<class T, class Node>
Dereferencing operator returns the object of the node currently pointed to by the iterator.
template<class T, class Node>
Move iterator to next key
template<class T, class Node>
Move iterator to next key
template<class T, class Node>
Move iterator to prev key
template<class T, class Node>
Move iterator to prev key
template<class T, class Node>
Move iterator to parent node
template<class T, class Node>
Move iterator to prev key
template<class T, class Node>
returns a pointer to the object of the node currently pointed to (as opposed to returning a copy of the node, as the dereferencing operator does).
template<class T, class Node>
Starts iterator over at the minimum, maximum or root node of the binary tree.
The documentation for this class was generated from the following file: