Lines Matching full:node
188 // Key can be greater than key of starting node.
191 // Key can be less than key of starting node.
194 // Key must be same as key of starting node.
201 // Equal node was sought and found as starting node.
325 // take greater branch from the nth node in the path, otherwise
333 // Handles of nodes in path from root to current node (returned by *).
352 // less from the node at depth N, if true branch greater.
356 // greater subtree has one more node than it's less subtree.
359 // Depth of root node of current subtree.
368 // together by having the "greater" handle of a node set to the
369 // next node in the list. "less_parent" is the handle of the first
370 // node in the list.
387 // I arbitrarily chose to always have the extra node in the
402 // Build a subtree with one node.
440 // next node in the sequence.
492 // Balances subtree, returns handle of root node of subtree
499 // this node has to be 2 levels deeper (or else it wouldn't
599 // Last unbalanced node encountered in search for insertion point.
601 // Parent of last unbalanced node.
603 // Balance factor of last unbalanced node.
610 // take greater branch from the nth node in the path, otherwise
634 // Add node to insert as leaf of tree.
760 // take greater branch from the nth node in the path, otherwise
771 // No node in tree with given key.
775 // Found node to remove.
786 // If the node to remove is not a leaf node, we need to get a
787 // leaf node, or a node with a single leaf as its child, to put
788 // in the place of the node to remove. We will get the greatest
789 // node in the less subtree (of the node to remove), or the least
790 // node in the greater subtree. We take the leaf node from the
820 // Only went through do loop once. Deleted node will be replaced
839 // from a depth of 2 to 1. If "path" is the node to be removed, we
840 // set path to the node we're about to poke into the position of the
841 // node to be removed.
845 // Poke in the replacement for the node to be removed.
861 // Create a temporary linked list from the parent of the path node
862 // to the root node.
878 // Climb from the path node to the root node using the linked
924 /* Search for node already in tree with same key. */
927 /* No node in tree with same key as new node. */
931 /* Found the node to substitute new one for. */
938 /* Copy tree housekeeping fields from node in tree to new node. */
944 /* New node is also new root. */
947 /* Make parent point to new node. */
