LeetCode之Minimum Depth of Binary Tree

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

wteo

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

阅读量946

点赞数

分类专栏： LeetCode leetcode

本文链接：https://blog.csdn.net/smileteo/article/details/21994991

版权

LeetCode 同时被 2 个专栏收录

55 篇文章 0 订阅

订阅专栏

leetcode

46 篇文章 0 订阅

订阅专栏

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.

此题与Maximum Depth of Binary Tree有区别谨慎！！！

For example,

    1
   / 
  2

The result should be 2！！Not 1

/**
 * Definition for binary tree
 * 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;
         if (!root->left && !root->right) return 1;
		 if (!root->left)
			 return 1 + minDepth(root->right);
		 if (!root->right)
			 return 1 + minDepth(root->left);
		 int left, right;
		 left= minDepth(root->left);
		 right = minDepth(root->right);
		 return  1 + (left < right ? left : right);
    }
};