Lines Matching full:right
120 // the right subtree.
193 // No left child, so the new tree is just the right child.
197 Node* right = root_->right_;
200 // Splay to make sure that the new root has an empty right child.
202 // Insert the original right child as the right child of the new
204 root_->right_ = right;
215 // counter-intuitive: The right child of the dummy node will hold
218 // and right will always be nodes and we avoid special cases.
221 Node* right = dummy;
229 // Rotate right.
237 // Link right.
238 right->left_ = current;
239 right = current;
263 right->left_ = current->right_;
287 if (node->right() != NULL) nodes_to_visit.Add(node->right(), allocator_);
