LeetCode --- 111. Minimum Depth of Binary Tree

111. Minimum Depth of Binary Tree

Difficulty: Easy

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.

Solution

思路

BFS的方法，层层遍历，当遇见是叶子节点leaf时，返回count即可。

Language: C++

/**
 * 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 minDepth(TreeNode* root) {
        if (!root)  return 0;
        queue<TreeNode*> q;
        q.push(root);
        int count = 0;
        while(!q.empty()){
            int size = q.size();
            count++;
            while(size--){
                TreeNode *temp = q.front();  
                if (temp->left==NULL && temp->right==NULL)
                    return count;
                if (temp->left)
                    q.push(temp->left);
                if (temp->right)
                    q.push(temp->right);
                q.pop();      
            }
        }
        return count;
    }
};