-
Notifications
You must be signed in to change notification settings - Fork 22
/
TreeTraversal.cpp
67 lines (59 loc) · 1.15 KB
/
TreeTraversal.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
#include <iostream>
using namespace std;
struct Node{
int data;
struct Node*left;
struct Node*right;
Node(int val){
data=val;
left=NULL;
right=NULL;
}
};
void preorder(struct Node*root){
//base case
if (root ==NULL){
return;
}
cout<<root->data<<" ";
preorder(root->left);
preorder(root->right);
}
void inorder(struct Node *root){
//base case
if (root ==NULL){
return;
}
inorder(root->left);
cout<<root->data<<" ";
inorder(root->right);
}
void postorder(struct Node *root){
//base case
if (root ==NULL){
return;
}
postorder(root->left);
postorder(root->right);
cout<<root->data<<" ";
}
/*
1
/ \
2 3
/ \ / \
4 5 6 7
*/
int main() {
struct Node* root =new Node(1);
root->left = new Node(2);
root->right = new Node(3);
root->left->left = new Node(4);
root->left->right = new Node(5);
root->right->left = new Node(6);
root->right -> right = new Node(4);
//preorder(root);
//inorder(root);
postorder(root);
return 0;
}