forked from GeeksforGeeks-VIT-Bhopal/GeekWeek-Local
-
Notifications
You must be signed in to change notification settings - Fork 0
/
day-2-Code1.cpp
76 lines (63 loc) · 1.21 KB
/
day-2-Code1.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
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
#include <bits/stdc++.h>
using namespace std;
struct Node
{
int data;
Node *left, *right;
};
Node* newNode(int data)
{
Node* temp = new Node();
temp->data = data;
temp->left = temp->right = NULL;
return temp;
}
int evenOddLevelDifference(Node* root)
{
if (!root)
return 0;
queue<Node*> q;
q.push(root);
int level = 0;
int evenSum = 0, oddSum = 0;
while (!q.empty())
{
int size = q.size();
level += 1;
while(size > 0)
{
Node* temp = q.front();
q.pop();
if(level % 2 == 0)
evenSum += temp->data;
else
oddSum += temp->data;
if (temp->left)
{
q.push(temp->left);
}
if (temp->right)
{
q.push(temp->right);
}
size -= 1;
}
}
return (oddSum - evenSum);
}
int main()
{
Node* root = newNode(5);
root->left = newNode(2);
root->right = newNode(6);
root->left->left = newNode(1);
root->left->right = newNode(4);
root->left->right->left = newNode(3);
root->right->right = newNode(8);
root->right->right->right = newNode(9);
root->right->right->left = newNode(7);
int result = evenOddLevelDifference(root);
cout << "diffence between sums is :: ";
cout << result << endl;
return 0;
}