| 358 | } |
| 359 | |
| 360 | RBTreeNode* treeMaxmum(RBTreeNode* x) |
| 361 | { |
| 362 | auto p = x; |
| 363 | while (p != nil) { |
| 364 | p = p->right; |
| 365 | } |
| 366 | return p; |
| 367 | } |
| 368 | |
| 369 | RBTreeNode* treeMinimum(RBTreeNode* x) |
| 370 | { |
nothing calls this directly
no outgoing calls
no test coverage detected