Lines Matching refs:right
136 // the right subtree.
209 // No left child, so the new tree is just the right child.
213 Node* right = root_->right_;
216 // Splay to make sure that the new root has an empty right child.
218 // Insert the original right child as the right child of the new
220 root_->right_ = right;
231 // counter-intuitive: The right child of the dummy node will hold
234 // and right will always be nodes and we avoid special cases.
237 Node* right = dummy;
245 // Rotate right.
253 // Link right.
254 right->left_ = current;
255 right = current;
279 right->left_ = current->right_;
302 if (node->right() != NULL) nodes_to_visit.Add(node->right());
