Height of a Tree

Problem Statement

Pattern:

---

public static int height(Node root) {
	if (root == null) return 0;
	
	int leftHeight = height(root.left);
	int rightHeight = height(root.right);
	
	return Math.max(leftHeight, rightHeight) + 1;
}