Leetcode-Solutions/get_half_nodes_bt.cpp at master · cpj2195/Leetcode-Solutions · GitHub

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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
#include"essentials.cpp"


struct btnode{
int data;
struct btnode*left;
struct btnode*right;


};


struct btnode*NewNode(int data){


struct btnode*node=(struct btnode*)malloc(sizeof(struct btnode));
node->data=data;
node->right=NULL;
node->left=NULL;
return node;


}


int get_halfnodes(struct btnode*root){

int count=0;
if(root==NULL || (root->left ==NULL && root->right==NULL))
{
    return 0;
}


else if((!root->left && root->right) || (!root->right && root->left)){
    return 1;
}

else{

queue<struct btnode*>q;
q.push(root);

struct btnode*temp=root;


while(!q.empty()){
int size=q.size();


for(int i=1;i<=size;i++){

temp=q.front();
q.pop();
if(temp->left){
    q.push(temp->left);
}
if(temp->right){
    q.push(temp->right);
}
if((!temp->left && temp->right)|| (!temp->right && temp->left)){
    count++;
}

}


}

return count;

}


}


int main(){


struct btnode *root = NewNode(38);
    root->left     = NewNode(30);
    root->right     = NewNode(56);
    root->left->right = NewNode(35);
    root->left->right->left = NewNode(32);
    root->left->right->right = NewNode(36);
    root->right->right = NewNode(60);
    root->right->left = NewNode(40);
    root->left->left=NewNode(20);


cout<<get_halfnodes(root)<<endl;


return 1;


}