26     root_ = new(allocator_) Node(key, Config::NoValue());  in Insert()
32     int cmp = Config::Compare(key, root_->key_);  in Insert()
34       locator->bind(root_);  in Insert()
41   locator->bind(root_);  in Insert()
49     node->left_ = root_;  in InsertInternal()
50     node->right_ = root_->right_;  in InsertInternal()
51     root_->right_ = NULL;  in InsertInternal()
53     node->right_ = root_;  in InsertInternal()
54     node->left_ = root_->left_;  in InsertInternal()
55     root_->left_ = NULL;  in InsertInternal()
57   root_ = node;  in InsertInternal()
66   return Config::Compare(key, root_->key_) == 0;  in FindInternal()
79     locator->bind(root_);  in Find()
97   int cmp = Config::Compare(root_->key_, key);  in FindGreatestLessThan()
99     locator->bind(root_);  in FindGreatestLessThan()
102     Node* temp = root_;  in FindGreatestLessThan()
103     root_ = root_->left_;  in FindGreatestLessThan()
105     root_ = temp;  in FindGreatestLessThan()
121   int cmp = Config::Compare(root_->key_, key);  in FindLeastGreaterThan()
123     locator->bind(root_);  in FindLeastGreaterThan()
126     Node* temp = root_;  in FindLeastGreaterThan()
127     root_ = root_->right_;  in FindLeastGreaterThan()
129     root_ = temp;  in FindLeastGreaterThan()
139   Node* current = root_;  in FindGreatest()
151   Node* current = root_;  in FindLeast()
164   Node* node_to_move = root_;  in Move()
167   int cmp = Config::Compare(new_key, root_->key_);  in Move()
183   Node* node_to_remove = root_;  in Remove()
192   if (root_->left_ == NULL) {  in RemoveRootNode()
194     root_ = root_->right_;  in RemoveRootNode()
197     Node* right = root_->right_;  in RemoveRootNode()
199     root_ = root_->left_;  in RemoveRootNode()
204     root_->right_ = right;  in RemoveRootNode()
222   Node* current = root_;  in Splay()
266   root_ = current;  in Splay()
279   if (root_ == NULL) return;  in ForEachNode()
282   nodes_to_visit.Add(root_, allocator_);  in ForEachNode()