Method size

code/data-structures/avl_tree.cpp:52–52

        n = n->p; }
      n = n->p; } }
  inline int size() const { return sz(root); }
  node* find(const T &item) const {
    node *cur = root;
    while (cur) {