【LeetCode】104.Maximum Depth of Binary Tree(Easy)解题报告

最新推荐文章于 2020-04-27 21:15:08 发布

郝春雨

最新推荐文章于 2020-04-27 21:15:08 发布

阅读量122

点赞数

分类专栏： LeetCode Tree 文章标签： leetcode tree

本文链接：https://blog.csdn.net/haoxiaoxiaoyu/article/details/79514112

版权

LeetCode 同时被 2 个专栏收录

183 篇文章 0 订阅

订阅专栏

Tree

47 篇文章 0 订阅

订阅专栏

【LeetCode】104.Maximum Depth of Binary Tree(Easy)解题报告

题目地址：https://leetcode.com/problems/maximum-depth-of-binary-tree/description/
题目描述：

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.

For example: Given binary tree [3,9,20,null,null,15,7] , return its depth = 3.

求二叉树的最大深度。

Solution1:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 二叉树的最大深度
 不断往下走，每走一次加一
 time : O(n)
 space : O(n)
 */
class Solution {
    public int maxDepth(TreeNode root) {
        if(root == null) return 0;
        return Math.max(maxDepth(root.left),maxDepth(root.right))+1;
    }
}

Solution2:

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 二叉树的最大深度
 不断往下走，每走一次加一
 time : O(n)
 space : O(n)
 */
class Solution {
    public int maxDepth(TreeNode root) {
        if(root == null) return 0;
        int l = maxDepth(root.left)+1;
        int r = maxDepth(root.right)+1;
        return Math.max(l,r);
    }
}