Lines Matching refs:right
53 ret->right = NULL;
66 TreeNodeDeleteWholeTree(node->right);
76 TreeNodePrint(node->right, keyPrint);
84 int rightdepth = TreeNodeDepth(root->right);
102 return TreeNodeFind(tree->right, key, compkey);
119 x = x->right;
124 * if newnode > y, then y->right is NULL.
136 y->right = newnode;
149 if(node->left == NULL || node->right == NULL) {
155 x = y->right;
167 y->parent->right = x;
176 if(y == node->right) /*y is the right child if node*/
183 else /*y != node->right*/
185 x = y->right;
193 y->parent->right = x;
197 y->right = node->right;
199 node->right->parent = y;
205 node->parent->right = y;
236 while(temp->right != NULL) {
237 temp = temp->right;
242 /*return the first node (in sorted order) which is to the right of this node
247 if(node->right != NULL)
248 return TreeNodeMinimum(node->right);
249 else{ /*node->right is NULL*/
251 /*find the first right-ancestor*/
254 while(y != NULL && x == y->right) /*if y is a left parent of x*/
275 while(y != NULL && x == y->left) /*if y is a right parent of x*/