111. Minimum Depth of Binary Tree

最新推荐文章于 2021-11-26 20:18:32 发布

ahdctjv534913

最新推荐文章于 2021-11-26 20:18:32 发布

阅读量70

点赞数

原文链接：http://www.cnblogs.com/wangzao2333/p/7586052.html

版权

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.

 1 /**
 2  * Definition for a binary tree node.
 3  * struct TreeNode {
 4  *     int val;
 5  *     TreeNode *left;
 6  *     TreeNode *right;
 7  *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 8  * };
 9  */
10 class Solution {
11 public:
12     int minDepth(TreeNode* root) {
13         if(!root)
14             return 0;
15         if(!root->left) 16 return 1+minDepth(root->right); 17 if(!root->right) 18 return 1+minDepth(root->left); 19 return 1+min(minDepth(root->left),minDepth(root->right)); 20  } 21 };

只要有子节点，就算只有一个子节点，当前节点就肯定不是叶节点，需要继续递归

转载于:https://www.cnblogs.com/wangzao2333/p/7586052.html