342     root: NodePtr<K, V>,  field
359             new.root = self.root.deep_clone();  in clone()
402         if self.root.is_null() {  in print_tree()
407         self.tree_print(self.root, 0);  in print_tree()
823         let iter = if self.root.is_null() {  in into_iter()
845             root: NodePtr::null(),  in new()
859         self.root.is_null()  in is_empty()
886         if node == self.root {  in left_rotate()
887             self.root = temp.clone();  in left_rotate()
921         if node == self.root {  in right_rotate()
922             self.root = temp.clone();  in right_rotate()
1017         self.root.set_black_color();  in insert_fixup()
1025         let mut x = self.root;  in insert()
1041             self.root = node;  in insert()
1061         if self.root.is_null() {  in find_node()
1064         let mut temp = &self.root;  in find_node()
1083         if self.root.is_null() {  in first_child()
1086             let mut temp = self.root;  in first_child()
1096         if self.root.is_null() {  in last_child()
1099             let mut temp = self.root;  in last_child()
1203         let root = self.root;  in clear()  localVariable
1204         self.root = NodePtr::null();  in clear()
1205         self.clear_recurse(root);  in clear()
1211         self.root = NodePtr::null();  in fast_clear()
1226         while node != self.root && node.is_black_color() {  in delete_fixup()
1255                     node = self.root;  in delete_fixup()
1286                     node = self.root;  in delete_fixup()
1307             if node == self.root {  in delete()
1308                 self.root = replace;  in delete()
1358         if self.root == node {  in delete()
1359             self.root = child  in delete()