| 14 | inline bool left_heavy(node *n) const { |
| 15 | return n && height(n->l) > height(n->r); } |
| 16 | inline bool right_heavy(node *n) const { |
| 17 | return n && height(n->r) > height(n->l); } |
| 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) { |
nothing calls this directly
no outgoing calls
no test coverage detected