Leetcode 111. Minimum Depth of Binary Tree (Easy) (cpp)

Niko_Ke

于 2016-07-23 16:21:20 发布

阅读量673

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/Niko_Ke/article/details/52005027

C++ 同时被 3 个专栏收录

299 篇文章

订阅专栏

Leetcode C++

287 篇文章

订阅专栏

Leetcode Tree

48 篇文章

订阅专栏

本文介绍了解决LeetCode 111题——求二叉树最小深度的方法。该题旨在寻找从根节点到最近叶子节点的最短路径上的节点数量。文章提供了一个使用递归的C++实现方案。

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

Leetcode 111. Minimum Depth of Binary Tree (Easy) (cpp)

Tag: Tree, Depth-first Search, Breadth-first Search

Difficulty: Easy

/*

111. Minimum Depth of Binary Tree (Easy)

Given a binary tree, find its minimum depth.

The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.

*/
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
 class Solution {
 public:
 	int minDepth(TreeNode* root) {
 		if (!root) return 0;
 		else if (!root -> left && !root -> right) return 1;
 		else {
 			int depth_L, depth_R;
 			if (root -> left) depth_L = minDepth(root -> left);
 			else depth_L = INT_MAX;
 			if (root -> right) depth_R = minDepth(root -> right);
 			else depth_R = INT_MAX;
 			return min(depth_L, depth_R) + 1;
 		}
 	}
 };