Lines Matching refs:tree
4 * Based on Abstract AVL Tree Template v1.5 by Walt Karas
124 // E.g., if, in a particular instantiation, the maximum number of nodes in a tree instance is 1,000,000, the maximum depth should be 28.
169 void start_iter(AVLTree &tree, key k, SearchType st = EQUAL)
174 // Save the tree that we're going to iterate through in a
176 tree_ = &tree;
185 // Tree is empty.
221 void start_iter_least(AVLTree &tree)
223 tree_ = &tree;
239 void start_iter_greatest(AVLTree &tree)
241 tree_ = &tree;
322 // Tree being iterated over.
325 // Records a path into the tree. If branch[n] is true, indicates
331 // Zero-based depth of path into tree.
437 // We've completed the full tree.
470 // The handle of the root element in the AVL tree.
607 // Zero-based depth in tree.
610 // Records a path into the tree. If branch[n] is true, indicates
635 // Add node to insert as leaf of tree.
654 // No rebalancing of tree is necessary.
757 // Zero-based depth in tree.
760 // Records a path into the tree. If branch[n] is true, indicates
772 // No node in tree with given key.
822 // in the tree structure by one of its immediate children.
832 // There were only 1 or 2 nodes in this tree.
880 // list, restoring the tree structure and rebalancing as necessary.
925 /* Search for node already in tree with same key. */
928 /* No node in tree with same key as new node. */
939 /* Copy tree housekeeping fields from node in tree to new node. */
