[LeetCode] Minimum Depth of Binary Tree

最新推荐文章于 2023-12-15 03:22:29 发布

原创最新推荐文章于 2023-12-15 03:22:29 发布 · 152 阅读

0 ·

CC 4.0 BY-SA版权

本文详细介绍了如何通过递归的方法计算给定二叉树的最小深度，即从根节点到最近叶子节点的节点数量。通过定义一个辅助函数，我们能够有效地解决这个问题，并提供了具体的代码实现。

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.

» Solve this problem

[解题报告]

[Code]

1:    int minDepth(TreeNode *root) {  
2:      // Start typing your C/C++ solution below  
3:      // DO NOT write int main() function  
4:      if(root == NULL)  
5:        return 0;  
6:      int lmin = minDepth(root->left);  
7:      int rmin = minDepth(root->right);  
8:      if(lmin ==0 && rmin ==0)  
9:        return 1;  
10:      if(lmin ==0)  
11:      {  
12:        lmin = INT_MAX;  
13:      }  
14:      if(rmin ==0)  
15:      {  
16:        rmin = INT_MAX;  
17:      }  
18:      return min(lmin, rmin) +1;  
19:    }