| | | | | |

Recursive Implementations

static size_t RSize(const Node * n)
{
  if (n == 0) return 0;
  return (1 + RSize(n -> lchild_) + RSize(n -> rchild_));
}

static int RHeight(const Node * n)
{
  if (n == 0) 
    return -1;
  return (1 + Max(RHeight(n -> lchild_), RHeight(n -> rchild_)));
}

| | Top of Page | 12. Binary Search Trees - 19 of 27