Compute height of a binary tree — recursive definition.

int height(TreeNode n) {
  if (n == null) return -1; // or 0 depending on definition
  return 1 + Math.max(height(n.left), height(n.right));
}