-
Notifications
You must be signed in to change notification settings - Fork 34
/
PrintLevelWise(BT)
84 lines (76 loc) · 2.12 KB
/
PrintLevelWise(BT)
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
#include <iostream>
#include <queue>
template <typename T>
class BinaryTreeNode {
public :
T data;
BinaryTreeNode<T> *left;
BinaryTreeNode<T> *right;
BinaryTreeNode(T data) {
this -> data = data;
left = NULL;
right = NULL;
}
};
using namespace std;
BinaryTreeNode<int>* takeInput() {
int rootData;
//cout << "Enter root data : ";
cin >> rootData;
if(rootData == -1) {
return NULL;
}
BinaryTreeNode<int> *root = new BinaryTreeNode<int>(rootData);
queue<BinaryTreeNode<int>*> q;
q.push(root);
while(!q.empty()) {
BinaryTreeNode<int> *currentNode = q.front();
q.pop();
int leftChild, rightChild;
//cout << "Enter left child of " << currentNode -> data << " : ";
cin >> leftChild;
if(leftChild != -1) {
BinaryTreeNode<int>* leftNode = new BinaryTreeNode<int>(leftChild);
currentNode -> left =leftNode;
q.push(leftNode);
}
//cout << "Enter right child of " << currentNode -> data << " : ";
cin >> rightChild;
if(rightChild != -1) {
BinaryTreeNode<int>* rightNode = new BinaryTreeNode<int>(rightChild);
currentNode -> right =rightNode;
q.push(rightNode);
}
}
return root;
}
#include<queue>
void printLevelWise(BinaryTreeNode<int> *root) {
if(root==NULL)
return;
queue<BinaryTreeNode<int>*> pending;
pending.push(root);
while(pending.size()!=0){
cout<<pending.front()->data<<":";
if(pending.front()->left==NULL){
cout<<"L:-1,";
}
if(pending.front()->left!=NULL){
cout<<"L:"<<pending.front()->left->data<<",";
pending.push(pending.front()->left);
}
if(pending.front()->right==NULL){
cout<<"R:-1";
}
if(pending.front()->right!=NULL){
cout<<"R:"<<pending.front()->right->data;
pending.push(pending.front()->right);
}
cout<<endl;
pending.pop();
}
}
int main() {
BinaryTreeNode<int>* root = takeInput();
printLevelWise(root);
}