111. Minimum Depth of Binary Tree

1.问题描述

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],
    3
   / \
  9  20
    /  \
   15   7
return its minimum depth = 2.

来自 <https://leetcode.com/problems/minimum-depth-of-binary-tree/description/> 

2.题目分析

找出二叉树的最小深度，即到叶子节点的最短步长，可通过层序遍历的非递归方式，当结点没有儿子节点时，终止遍历，返回当前的层数，即最小的深度。

3.C++代码

//我的代码：（beats 91%）
int minDepth(TreeNode*p)
{
    if (p == NULL)
        return 0;
    int deepth = 0;
    bool flag = 1;
    queue<TreeNode*>q;
    q.push(p);
    while (!q.empty()&&flag)
    {
        deepth++;
        int n = q.size();
        for (int i = 0; i < n; i++)
        {
            TreeNode*tmp = q.front();
            q.pop();
            if (tmp->left)
                q.push(tmp->left);
            if (tmp->right)
                q.push(tmp->right);
            if (tmp->left == NULL&&tmp->right == NULL)
            {
                flag = 0;
                break;
            }
        }
    }
    return deepth;
}