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.

分析：

递归的向下找， 取左右子树中深度最大的子树。

Java代码实现：

/**
* Definition for a binary tree node.
* 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;

return Math.max(maxDepth(root.left), maxDepth(root.right))+1;
}
}