-
Notifications
You must be signed in to change notification settings - Fork 0
/
CheckCompletenessOfBinaryTree.cpp
50 lines (50 loc) · 1.3 KB
/
CheckCompletenessOfBinaryTree.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
/**
* 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 checkComplete(TreeNode * root){
if(root == nullptr){
return true;
}
else if(!root->left && !root->right){
return true;
}else if(root->left && !root->right){
return false;
}
}
bool isCompleteTree(TreeNode* root) {
if(root==nullptr){
return true;
}
queue<TreeNode *> q;
bool zeroChild = false;
q.push(root);
while(!q.empty()){
int x = q.size();
for(int i = 0; i<x; i++){
auto t = q.front();
if((t->left == nullptr && t->right!= nullptr) || (zeroChild && (t->left || t->right))){
return false;
}
if(t->left && t->right){
q.push(t->left);
q.push(t->right);
}else{
if(t->left){
q.push(t->left);
}
zeroChild = true;
}
q.pop();
}
}
return true;
}
};