#include <compact_tree.h>
|
|
typedef CT_NODE_T | reference |
|
typedef void | pointer |
|
|
| postorder_iterator (CT_NODE_T x) |
|
| postorder_iterator (const postorder_iterator &it) |
|
postorder_iterator & | operator= (const postorder_iterator &it) |
|
postorder_iterator & | operator++ () |
|
postorder_iterator | operator++ (int) |
|
bool | operator== (const postorder_iterator &rhs) const |
|
bool | operator!= (const postorder_iterator &rhs) const |
|
CT_NODE_T | operator* () const |
Postorder traversal iterator. The only guarantee is that a node will be visited before its parent.
The documentation for this class was generated from the following file: