leetcode题记:Maximum Depth of Binary Tree

编程语言:JAVA

题目描述:

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.

提交反馈:

39 / 39 test cases passed.
Status: Accepted
Runtime: 0 ms
Submitted: 0 minutes ago
You are here! 
Your runtime beats 100.00 % of java submissions.

解题思路:

知道这是一道递归题目,但是就是写不出递归程序,太菜了。。。。
继续练习吧。。。。。。。。。。。。。。。。。。。。。。。。。。。

代码:

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

    }
}
已标记关键词 清除标记
相关推荐
©️2020 CSDN 皮肤主题: 书香水墨 设计师:CSDN官方博客 返回首页