Data-Structures-And-Algorithms-Hacktoberfest18/cpp/algorithms/tree-traversals.cpp at dd1f714d27cbe27f59b05bd6913b08a058d57244 · yshshrm/Data-Structures-And-Algorithms-Hacktoberfest18 · 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
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
#include <iostream>
using namespace std;

struct Node {
	int data;
	struct Node *left, *right;
};


Node* newNode(int data)
{
	Node* temp = new Node;
	temp->data = data;
	temp->left = temp->right = NULL;
	return temp;
}

void printPostorder(struct Node* node)
{
	if (node == NULL)
		return;


	printPostorder(node->left);


	printPostorder(node->right);


	cout << node->data << " ";
}


void printInorder(struct Node* node)
{
	if (node == NULL)
		return;


	printInorder(node->left);


	cout << node->data << " ";


	printInorder(node->right);
}


void printPreorder(struct Node* node)
{
	if (node == NULL)
		return;


	cout << node->data << " ";


	printPreorder(node->left);


	printPreorder(node->right);
}


int main()
{
	struct Node* root = newNode(1);
	root->left = newNode(2);
	root->right = newNode(3);
	root->left->left = newNode(4);
	root->left->right = newNode(5);

	cout << "\nPreorder traversal of binary tree is \n";
	printPreorder(root);

	cout << "\nInorder traversal of binary tree is \n";
	printInorder(root);

	cout << "\nPostorder traversal of binary tree is \n";
	printPostorder(root);

	return 0;
}