Method find

code/data-structures/avl_tree.cpp:53–59

      n = n->p; } }
  inline int size() const { return sz(root); }
  node* find(const T &item) const {
    node *cur = root;
    while (cur) {
      if (cur->item < item) cur = cur->r;
      else if (item < cur->item) cur = cur->l;
      else break; }
    return cur; }
  node* insert(const T &item) {
    node *prev = NULL, **cur = &root;
    while (*cur) {