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.

题意：给定二叉树，找出最大深度

思路：DFS

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