• alloc_ : tree< T, tree_node_allocator >
• comp_ : tree< T, tree_node_allocator >::tree::compare_nodes< StrictWeakOrdering >
• data : tree_node_< T >
• feet : tree< T, tree_node_allocator >
• first_child : tree_node_< T >
• head : tree< T, tree_node_allocator >
• last_child : tree_node_< T >
• next_sibling : tree_node_< T >
• node : tree< T, tree_node_allocator >::tree::iterator_base
• parent : tree_node_< T >
• parent_ : tree< T, tree_node_allocator >::tree::sibling_iterator
• prev_sibling : tree_node_< T >
• skip_current_children_ : tree< T, tree_node_allocator >::tree::iterator_base
• top_node : tree< T, tree_node_allocator >::tree::fixed_depth_iterator , tree< T, tree_node_allocator >::tree::leaf_iterator
• traversal_queue : tree< T, tree_node_allocator >::tree::breadth_first_queued_iterator