Class List
Here are the classes, structs, unions and interfaces with brief descriptions:
| tree< T, tree_node_allocator > | |
| tree< T, tree_node_allocator >::tree::breadth_first_queued_iterator | Breadth-first iterator, using a queue |
| tree< T, tree_node_allocator >::tree::compare_nodes< StrictWeakOrdering > | Comparator class for two nodes of a tree (used for sorting and searching) |
| tree< T, tree_node_allocator >::tree::fixed_depth_iterator | Iterator which traverses only the nodes at a given depth from the root |
| tree< T, tree_node_allocator >::tree::iterator_base | Base class for iterators, only pointers stored, no traversal logic |
| tree< T, tree_node_allocator >::tree::iterator_base_less | Comparator class for iterators (compares pointer values; why doesn't this work automatically?) |
| tree< T, tree_node_allocator >::tree::leaf_iterator | Iterator which traverses only the leaves |
| tree< T, tree_node_allocator >::tree::post_order_iterator | Depth-first iterator, first accessing the children, then the node itself |
| tree< T, tree_node_allocator >::tree::pre_order_iterator | Depth-first iterator, first accessing the node, then its children |
| tree< T, tree_node_allocator >::tree::sibling_iterator | Iterator which traverses only the nodes which are siblings of each other |
| tree_node_< T > | A node in the tree, combining links to other nodes as well as the actual data |
