LeetCode - Maximum Depth of Binary Tree

https://leetcode.com/problems/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.

这道题还是比较简单的，就是递归就行了。

public class Solution {
    public int maxDepth(TreeNode root) {
        if(root == null) return 0;
        if(root.left == null && root.right==null) return 1;
        return Math.max(maxDepth(root.left), maxDepth(root.right))+1;
    }
}