-
Notifications
You must be signed in to change notification settings - Fork 0
/
Exp7_BinaryTreeTraversal.c
136 lines (128 loc) · 3.15 KB
/
Exp7_BinaryTreeTraversal.c
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
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
// Srushti Patil IT-A-43
#include <stdio.h>
#include <conio.h>
#include <stdlib.h>
#include <malloc.h>
struct node
{
int data;
struct node *left;
struct node *right;
};
struct node *tree;
void create(struct node *);
struct node *insert(struct node *, int);
void inorder(struct node *);
void preorder(struct node *);
void postorder(struct node *);
void main()
{
printf("\n --- WELCOME TO IMPLEMENTATION OF BINARY TREE TRAVERSALS --- \n");
int choice, x;
struct node *ptr;
create(tree);
do
{
printf("\n *** --- opertaions available --- *** ");
printf("\n 1. Insert a Node");
printf("\n 2. Display Inorder Traversal");
printf("\n 3. Display Preorder Traversal");
printf("\n 4. Display Postorder Traversal");
printf("\n 5. Exit \n");
printf(" Please enter your choice : ");
scanf("%d", &choice);
switch (choice)
{
case 1:
printf("\n Enter the data to be inserted : ");
scanf("%d", &x);
tree = insert(tree, x);
break;
case 2:
printf("\n Elements in the inorder traversala are : ");
inorder(tree);
printf("\n");
break;
case 3:
printf("\n Elements in the preorder traversala are : ");
preorder(tree);
printf("\n");
break;
case 4:
printf("\n Elements in the postorder traversala are : ");
postorder(tree);
printf("\n");
break;
default:
printf("\n Please enter a valid option 1, 2, 3, 4.");
break;
}
} while (choice != 5);
}
void create(struct node *tree)
{
tree = NULL;
}
// Function for inserting a new node
struct node *insert(struct node *tree, int x)
{
struct node *p, *temp, *root;
p = (struct node *)malloc(sizeof(struct node));
p->data = x;
p->left = NULL;
p->right = NULL;
if (tree == NULL)
{
tree = p;
tree->left = NULL;
tree->right = NULL;
}
else
{
root = NULL;
temp = tree;
while (temp != NULL)
{
root = temp;
if (x < temp->data)
temp = temp->left;
else
temp = temp->right;
}
if (x < root->data)
root->left = p;
else
root->right = p;
}
return tree;
}
// Function for Inorder Traversals
void inorder(struct node *tree)
{
if (tree != NULL)
{
inorder(tree->left);
printf(" %d \t", tree->data);
inorder(tree->right);
}
}
// Function for Preorder Traversals
void preorder(struct node *tree)
{
if (tree != NULL)
{
printf(" %d \t", tree->data);
preorder(tree->left);
preorder(tree->right);
}
}
// Function for Postorder Traversals
void postorder(struct node *tree)
{
if (tree != NULL)
{
postorder(tree->left);
postorder(tree->right);
printf(" %d \t", tree->data);
}
}