Memory leak in AVL tree

[Tagl]

There is a memory leak in the AVL tree. An early return in the erase function causes a memory leak. Can be resolved by changing

    else if (n->l && n->r) {
      node *s = successor(n);
      erase(s, false);
      s->p = n->p, s->l = n->l, s->r = n->r;
      if (n->l) n->l->p = s;
      if (n->r) n->r->p = s;
      parent_leg(n) = s, fix(s);
      return;
    }

to

    else if (n->l && n->r) {
      node *s = successor(n);
      erase(s, false);
      s->p = n->p, s->l = n->l, s->r = n->r;
      if (n->l) n->l->p = s;
      if (n->r) n->r->p = s;
      parent_leg(n) = s, fix(s);
      delete n;
      return;
    }