#include <compact_tree.h>

Inheritance diagram for compact_tree::postorder_iterator:

Collaboration diagram for compact_tree::postorder_iterator:

Public Member Functions
	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* ()

Detailed Description

Postorder traversal iterator. The only guarantee is that a node will be visited before its parent. Currently, nodes will be visited in reverse of the order they appear in the original Newick string.

The documentation for this class was generated from the following file:

CompactTree/compact_tree.h

Public Member Functions

Detailed Description