| 367 | } |
| 368 | |
| 369 | RBTreeNode* treeMinimum(RBTreeNode* x) |
| 370 | { |
| 371 | auto p = x; |
| 372 | while (p->left != nil) { |
| 373 | p = p->left; |
| 374 | } |
| 375 | return p; |
| 376 | } |
| 377 | |
| 378 | void deleteInternal(RBTreeNode* z) |
| 379 | { |
nothing calls this directly
no outgoing calls
no test coverage detected