| 18 | inline bool too_heavy(node *n) const { |
| 19 | return n && abs(height(n->l) - height(n->r)) > 1; } |
| 20 | void delete_tree(node *n) { if (n) { |
| 21 | delete_tree(n->l), delete_tree(n->r); delete n; } } |
| 22 | node*& parent_leg(node *n) { |
| 23 | if (!n->p) return root; |
| 24 | if (n->p->l == n) return n->p->l; |
nothing calls this directly
no outgoing calls
no test coverage detected