Maximum Depth of Binary Tree

最新推荐文章于 2020-07-16 16:59:19 发布

黑黑的小白羊

最新推荐文章于 2020-07-16 16:59:19 发布

阅读量379

点赞数

分类专栏： LeetCode OJ 文章标签： LeetCode

本文链接：https://blog.csdn.net/cy_tiaot/article/details/39620305

版权

LeetCode OJ 专栏收录该内容

5 篇文章 0 订阅

订阅专栏

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.

/**
 * Definition for binary tree
 * 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 leftDepth = maxDepth(root.left);
        int rightDepth = maxDepth(root.right);
        int depth =  Math.max(leftDepth, rightDepth);
        return depth + 1;
    }
}