[leedcode 104] Maximum Depth of Binary Tree

/**
 * 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) {
        //求最大深度（高度），使用递归，分别求左子树和右子树的深度，取最大的+1
        if(root==null) return 0;
        return Math.max(maxDepth(root.left),maxDepth(root.right))+1;
        
    }
}