[Leetcode-48]Maximum Depth of Binary Tree

最新推荐文章于 2025-11-26 01:11:47 发布

原创最新推荐文章于 2025-11-26 01:11:47 发布 · 753 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #二叉树 #递归 #dfs

Leetcode 同时被 2 个专栏收录

287 篇文章

订阅专栏

LeetCode Questions

178 篇文章

订阅专栏

本文介绍了一种使用深度优先搜索(DFS)算法来解决寻找二叉树最大深度的问题。通过递归的方式，该算法能够遍历从根节点到最远叶子节点的最长路径上的所有节点，并返回此路径的长度。

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.

Analysis:
This is an easy problem. DFS (depth first search) is enough to solve it. Details see source code.

c++

int maxDepth(TreeNode *root) {
        if(root == NULL)
        return 0;
    int left = maxDepth(root->left);
    int right = maxDepth(root->right);
    return max(left,right)+1;
    }

java

public int maxDepth(TreeNode root) {
        if(root == null)
	    	 return 0;
	     int left = maxDepth(root.left);
	     int right  = maxDepth(root.right);
		 return 1 + Math.max(left,right);
    }

iteratively version

http://leetcode.com/2010/04/maximum-height-of-binary-tree.html