跳到主要内容

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.

分析

代码

// Maximum Depth of Binary Tree
// 时间复杂度O(n),空间复杂度O(logn)
class Solution {
public int maxDepth(TreeNode root) {
if (root == null) return 0;

return Math.max(maxDepth(root.left), maxDepth(root.right)) + 1;
}
}

相关题目