Maximum Depth of Binary Tree @LeetCode

Given a binary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

	package leetcode.tree;
	/**
	* Classic Practice of Divide & Conquer
	* @author jeffwan
	* @date Feb 11, 2014
	*/
	public class MaxDepth {
	/**
	* Though: maxDepth == Max(left, right) + 1.
	*/
	public int maxDepth(TreeNode root) {
	if (root == null) {
	return 0;
	}
	int left = maxDepth(root.left);
	int right = maxDepth(root.right);
	return Math.max(left, right) + 1;
	}
	// TreeNode
	private class TreeNode {
	int val;
	TreeNode left;
	TreeNode right;
	TreeNode (int x) {
	val = x;
	}
	}
	}

view raw MaxDepth.java hosted with ❤ by GitHub