Lines Matching defs:tree
77 * Perform a ``left rotation'' adjustment on the tree. The given node P and
80 * for P. The ordering of the keys within the tree is thus preserved.
132 * Do a postorder traversal of the tree rooted at the specified
146 * search tree. It performs an inorder traversal of the tree using the
213 * Compute the actual count of nodes by traversing the tree and
228 * Verify that the tree contains the given node. This is done by
285 * from the tree before deleting it is required.
376 * this function succeeds doesn't mean that the tree is not corrupt. Certain
377 * corruptions in the tree may simply cause undefined behavior.
394 /* perform a weak test that the tree is a binary search tree */
397 /* verify that the tree is a red-black tree */
554 /* basic binary tree insert */
653 * from the tree. We cannot use this approach because the user may hold
670 * First, splice out the successor from the tree completely, by
685 * Now that the successor has been extricated from the tree, install it
1063 dnode_t *tree[DICT_DEPTH_MAX] = { 0 };
1084 complete = tree[0];
1087 tree[0] = 0;
1089 while (tree[level] != 0) {
1090 tree[level]->right = complete;
1091 complete->parent = tree[level];
1092 complete = tree[level];
1093 tree[level++] = 0;
1105 while (tree[level] != 0) {
1106 tree[level]->right = complete;
1107 complete->parent = tree[level];
1108 complete = tree[level];
1109 tree[level++] = 0;
1115 tree[level] = curr;
1125 if (tree[i] != 0) {
1126 tree[i]->right = complete;
1127 complete->parent = tree[i];
1128 complete = tree[i];