LeetCode -- Maximum Depth of Binary Tree

Question:

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.

 

Analysis:

问题描述：给出一棵二叉树，求出它的最大深度。最大深度是指从根节点到最远的叶子节点的深度。

思路一：递归求解。分别求左子树的深度和右子树的深度，然后返回较深的一边的深度。

 

Answer：

/**
 * 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) {
        if(root == null)
            return 0;
        int left = maxDepth(root.left);
        int right = maxDepth(root.right);
        
        return left > right ? left + 1 : right + 1;
    }
    
}