题目描述
解法:层遍历(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:
bool isCompleteTree(TreeNode* root) {
queue<TreeNode*> q;
q.push(root);
bool flag = false;
while(q.size())
{
TreeNode* cur = q.front();
q.pop();
if(cur)
{
if(flag) return false;
q.push(cur->left);
q.push(cur->right);
}
else flag = true;
}
return true;
}
};