tree< T, tree_node_allocator >::post_order_iterator Class Reference

Depth-first iterator, first accessing the children, then the node itself. More...

#include <tree.h>

Inheritance diagram for tree< T, tree_node_allocator >::post_order_iterator:

[legend]

Collaboration diagram for tree< T, tree_node_allocator >::post_order_iterator:

[legend]

List of all members.

Public Member Functions
void	descend_all ()
	Set iterator to the first child as deep as possible down the tree.

---

Detailed Description

template<class T, class tree_node_allocator = std::allocator<tree_node_<T> >>
class tree< T, tree_node_allocator >::post_order_iterator

Depth-first iterator, first accessing the children, then the node itself.

---

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

• D:/Uni/InfoVis/LU/src/tree.h