力扣刷题记录43.1-----111. 二叉树的最小深度-CSDN博客

本文链接：https://blog.csdn.net/taiyuezyh/article/details/126675794

一、题目

在这里插入图片描述

二、代码

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    int minDepth(TreeNode* root) 
    {

     int return_num=0;
     int stop_flag=0;
     int i,j;

     queue<TreeNode*> range_first_tree;
     int queue_size;
     TreeNode* process_node;

     if(root!=nullptr)
     {

        range_first_tree.push(root);
        while(!range_first_tree.empty())
        {
           return_num++;
           queue_size=range_first_tree.size();
           for(i=0;i<queue_size;i++)
           {
             process_node=range_first_tree.front();
             range_first_tree.pop();
             
             if(!(process_node->left)&&!(process_node->right))  //两个叶子节点都为空 表示可以终止了 
             {
                 stop_flag=1;
                 break;
             }
             else
             {
                if(process_node->left) range_first_tree.push(process_node->left);
                if(process_node->right) range_first_tree.push(process_node->right);
             }
           }

           if(stop_flag==1) break;
        }


     }


      return return_num;
    }
};