LeetCode---Maximum Depth of Binary Tree

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.

题目要求：

最大深度是指从根节点到最远子节点的节点个数。

解题思路：

解决这个问题可以使用递归的思想，这种想法简单而清晰。

Solution:

/**
 * 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 nLeftDeep = maxDepth(root.left);
        int nRightDeep = maxDepth(root.right);
        return 1+Math.max(nLeftDeep,nRightDeep);
    }
    
}