| 109 | else break; |
| 110 | } return cur; } |
| 111 | int count_less(node *cur) { |
| 112 | int sum = sz(cur->l); |
| 113 | while (cur) { |
| 114 | if (cur->p && cur->p->r == cur) sum += 1 + sz(cur->p->l); |
| 115 | cur = cur->p; |
| 116 | } return sum; } |
| 117 | void clear() { delete_tree(root), root = NULL; } }; |
| 118 | // vim: cc=60 ts=2 sts=2 sw=2: |
nothing calls this directly
no outgoing calls
no test coverage detected