data-structures-and-algorithms/tree_traversals.cpp at main · Open-code-source/data-structures-and-algorithms · 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
#include <iostream>
using namespace  std;

class Node{

public:
	int data;
	Node *left,*right;

	Node(int val) {
		data=val;
		left=right=NULL;
		}
};

void InorderPrint(Node *root){
	if(root==NULL){
		return;
	}
	InorderPrint(root->left);
	cout<<root->data<<" ";
	InorderPrint(root->right);
}


void Preorder(Node *root){
	if(root==NULL){
		return;
	}

	cout<<root->data<<" ";
	Preorder(root->left);
	Preorder(root->right);
}


void Postorder(Node *root){
	if(root==NULL){
		return;
	}

	Preorder(root->left);
	Preorder(root->right);
	cout<<root->data<<" ";;
}


int main(){

	 b
	root->left=new Node(2);
	root->right=new Node(3);
	root->left->left=new Node(4);
	root->right->right=new Node(5);
	root->left->right=new Node(6);
	root->right->left=new Node(7);

	cout<<"This is Inorder Print"<<endl;
	InorderPrint(root);
	cout<<endl;
	cout<<"This is Preorder Print"<<endl;
	Preorder(root);
	cout<<endl;
	cout<<"This is Postorder Print"<<endl;
	Postorder(root);
	cout<<endl;

	return 0;
}