111. Minimum Depth of Binary Tree

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

石前有座桥

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

阅读量101

点赞数

分类专栏： leetcode-easy

本文链接：https://blog.csdn.net/lyw_321/article/details/89455575

版权

leetcode-easy 专栏收录该内容

121 篇文章 0 订阅

订阅专栏

111. Minimum Depth of Binary Tree

Easy

679361FavoriteShare

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.

Note: A leaf is a node with no children.

Example:

Given binary tree [3,9,20,null,null,15,7],

return its minimum depth = 2.

/**
 * 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 minn=(1<<31)-1;
    
    void dfs(TreeNode* root,int depth){
        if(root){
            if(root->left==NULL&&root->right==NULL){
                if(depth<minn){
                    minn=depth;
                }
            }
            dfs(root->left,depth+1);
            dfs(root->right,depth+1);
        }
    }
    int minDepth(TreeNode* root) {
        if(!root){
            return 0;
        }
        dfs(root,1);
        return minn;
        
    }
};