// BTDepth - calculate and print the depth of the binary tree

public class BTDepth {

	public static void main(String[] args) {
		BTNode<Integer> root;

		root = beginningTree();

		root.preorderPrint();
		System.out.println();
		root.inorderPrint();
		System.out.println();
		root.postorderPrint();
		root.print(0);

		int max = maxDepth(root, 0);
		
		System.out.println("Tree depth = " + max);

	}

	public static BTNode<Integer> beginningTree() {
		BTNode<Integer> root;
		BTNode<Integer> child;

		root = new BTNode<Integer>(14, null, null);

		child = new BTNode<Integer>(17, null, null);
		root.setLeft(child);
		child.setLeft(new BTNode<Integer>(9, null, null));
		child.setRight(new BTNode<Integer>(53, null, null));
		child = child.getLeft();
		child.setLeft(new BTNode<Integer>(13, null, null));
		child = child.getLeft();
		child.setRight(new BTNode<Integer>(21, null, null));
		child = new BTNode<Integer>(11, null, null);
		root.setRight(child);
		child.setLeft(new BTNode<Integer>(4, null, null));
		child = child.getLeft();
		child.setLeft(new BTNode<Integer>(19, null, null));
		child.setRight(new BTNode<Integer>(7, null, null));

		return root;
	}

	public static int maxDepth(BTNode<Integer> t, int depth) {

		int lMax;
		int rMax;
		
		if (t != null) {
			if (t.isLeaf())
				return depth;
			else {
				lMax = maxDepth(t.getLeft(), depth+1);
				rMax = maxDepth(t.getRight(), depth + 1);
				if (lMax > rMax) 
					return lMax;
				else 
					return rMax;
			}
		}
		else 
			return 0;
	}
}