/
binarytree.cpp
109 lines (91 loc) · 2.21 KB
/
binarytree.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
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
#include<iostream>
#include<queue>
using namespace std;
class node {
public:
int data;
node* left;
node* right;
node(int d) {
this -> data = d;
this -> left = NULL;
this -> right = NULL;
}
};
node* buildTree(node* root) {
cout << "Enter the data: " << endl;
int data;
cin >> data;
root = new node(data);
if(data == -1) {
return NULL;
}
cout << "Enter data for inserting in left of " << data << endl;
root->left = buildTree(root->left);
cout << "Enter data for inserting in right of " << data << endl;
root->right = buildTree(root->right);
return root;
}
void levelOrderTraversal(node* root) {
queue<node*> q;
q.push(root);
q.push(NULL);
while(!q.empty()) {
node* temp = q.front();
q.pop();
if(temp == NULL) {
//purana level complete traverse ho chuka hai
cout << endl;
if(!q.empty()) {
//queue still has some child ndoes
q.push(NULL);
}
}
else{
cout << temp -> data << " ";
if(temp ->left) {
q.push(temp ->left);
}
if(temp ->right) {
q.push(temp ->right);
}
}
}
}
void inorderTraversal(node *root){
if(root == NULL){
return;
}
inorderTraversal(root->left);
cout<<root->data<<" ";
inorderTraversal(root->right);
}
void PreorderTraversal(node *root){
if(root == NULL){
return;
}
cout<<root->data<<" ";
PreorderTraversal(root->left);
PreorderTraversal(root->right);
}
void PostorderTraversal(node *root){
if(root == NULL){
return;
}
PostorderTraversal(root->left);
PostorderTraversal(root->right);
cout<<root->data<<" ";
}
int main(){
node *root = NULL;
root = buildTree(root);
cout<<"printing the levelOrderTRaversal root"<<endl;
levelOrderTraversal(root);
inorderTraversal(root);
cout<< endl <<"PreorderTraversal is";
PreorderTraversal(root);
cout<< endl <<"PostorderTraversal is";
PostorderTraversal(root);
return 0;
}
//1 3 7 -1 -1 11 -1 -1 5 17 -1 -1 -1