二叉树的层序遍历

该题为求最小深度

class Solution {
public:
    int minDepth(TreeNode* root) {
        if (root == NULL) {
            return
        } 
        int dep = 0;
        queue <TreeNode*> que;
        que.push(root);
        while (!que.empty()) {
            dep ++;
            int flag = 0;
            int size = que.size();
            for (int i = 0; i < size; i ++) {
                TreeNode* node = que.front();
                que.pop();
                if (node -> left) que.push(node -> left);
                if (node -> right) que.push(node -> right);
                if (!node -> right && !node -> left) {
                    flag = 1;
                    break;
                }
            }
            if (flag == 1) break;
        }
        return dep;
    }
};

标签：node,right,int,模版,层序,flag,que,二叉树,size
来源： https://www.cnblogs.com/yueming/p/16168417.html