Question

In Java, write a program that finds the max binary tree height.

EXPERT ANSWER

Assuming the following definition, in Java, for a binary tree node:

class Node

{

int data;

Node left, right;

Node(int item)

{

data = item;

left = right = null;

}

}

We find the maximum height by computing the number of nodes along the longest path from the root down to the farthest leaf node, recursively calculating the height of