| 327 | } |
| 328 | |
| 329 | RBTreeNode* treeMinimum(RBTreeNode* x) |
| 330 | { |
| 331 | auto p = x; |
| 332 | while (p->left != nil) { |
| 333 | p = p->left; |
| 334 | } |
| 335 | return p; |
| 336 | } |
| 337 | |
| 338 | void deleteInternal(RBTreeNode* z) |
| 339 | { |
nothing calls this directly
no outgoing calls
no test coverage detected