#include <vdkbtrees.h>
Iterator is implementes as a member of AbstractBinaryTree rather than an external object.
|
ructor
|
|
Destructor |
|
Dereferencing operator returns the object of the node currently pointed to by the iterator. |
|
Move iterator to next key |
|
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). |
|
Dereferencing operator returns the object of the node currently pointed to by the iterator. |
|
Returns o if iterator points a non valid node. ie: was moved behind the lowest/highest key |
|
Move iterator to next key |
|
Move iterator to next key |
|
Move iterator to prev key |
|
Move iterator to prev key |
|
Move iterator to parent node |
|
Move iterator to prev key |
|
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). |
|
Starts iterator over at the minimum, maximum or root node of the binary tree. |