lintcode97- Maximum Depth of Binary Tree- easy

Posted jasminemzy

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了lintcode97- Maximum Depth of Binary Tree- easy相关的知识,希望对你有一定的参考价值。

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.

Example

Given a binary tree as follow:

  1
 / \ 
2   3
   /   4   5

The maximum depth is 3.

 

分治法做。本层高度就是max(左高度,右高度) +1。出口是null->0。

 

/**
 * Definition of TreeNode:
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left, right;
 *     public TreeNode(int val) {
 *         this.val = val;
 *         this.left = this.right = null;
 *     }
 * }
 */
public class Solution {
    /**
     * @param root: The root of binary tree.
     * @return: An integer.
     */
    public int maxDepth(TreeNode root) {
        // write your code here
        if (root == null){
            return 0;
        }

        int leftDepth = maxDepth(root.left) + 1;
        int rightDepth = maxDepth(root.right) + 1;

        return Math.max(leftDepth, rightDepth);
    }
}

 

以上是关于lintcode97- Maximum Depth of Binary Tree- easy的主要内容,如果未能解决你的问题,请参考以下文章

LintCode: Maximum Depth of Binary Tree

lintcode-easy-Maximum Depth of Binary Tree

[LintCode] Maximum Depth of Binary Tree 二叉树的最大深度

lintcode-medium-Maximum Subarray II

[LintCode] Maximum Subarray 最大子数组

[LintCode] Maximum Gap 求最大间距