LeetCode Maximum Depth of Binary Tree

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.

思路：就是递归。

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public int maxDepth(TreeNode root) {
    	if (root == null) return 0;
    	int l = maxDepth(root.left);
    	int r = maxDepth(root.right);
    	return Math.max(l, r) + 1;
    }
}

LeetCode Maximum Depth of Binary Tree

原文：http://blog.csdn.net/u011345136/article/details/45418247