LeetCode解题之104. Maximum Depth of Binary Tree（Java）

题目描述：

104. 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.

Note: A leaf is a node with no children.

Example:

Given binary tree [3,9,20,null,null,15,7],

    3
   / \
  9  20
    /  \
   15   7

return its depth = 3.

求二叉树的深度，采用深度优先遍历，分别计算左右子树的深度，返回最大者

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public int maxDepth(TreeNode root) {
        // 递归
        int count1 = 0;
        int count2 = 0;
        if(root == null)
            return 0;
        TreeNode l = root.left;
        TreeNode r = root.right;
        count1 = maxDepth(l);
        count2 = maxDepth(r);
        return Math.max(count1,count2) + 1;
    }
}