leetcode - Maximum Depth of Binary Tree

最新推荐文章于 2024-10-15 15:32:42 发布

weixin_30655219

最新推荐文章于 2024-10-15 15:32:42 发布

阅读量87

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/yfceshi/p/6970159.html

本文介绍了一种求解二叉树最大深度的算法实现，通过深度优先搜索(DFS)遍历二叉树的所有节点，找到从根节点到最远叶节点的最长路径上的节点数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
struct TreeNode
{
	int val;
	TreeNode *left;
	TreeNode *right;
	TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
class Solution {
public:
    int maxDepth(TreeNode *root) {
		MaxDepth = 0;
		dfs(root,0);
		return MaxDepth;
    }
private:
	int MaxDepth;
	void dfs(TreeNode *root,int level)
	{
		if(root == NULL) return;
		if(root->left == NULL && root->right == NULL)
		{
			if(MaxDepth < level) MaxDepth = level;
		}
		dfs(root->left,level+1);
		dfs(root->right,level+1);
	}
};

转载于:https://www.cnblogs.com/yfceshi/p/6970159.html