-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathTree
99 lines (89 loc) · 2.14 KB
/
Tree
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
#include<stdio.h>
#include<stdlib.h>
struct node
{
int data;
struct node *lchild;
struct node *rchild;
};
struct node *newn(int data)
{
struct node *newnode;
newnode =(struct node*)malloc(sizeof(struct node));
newnode->data=data;
newnode->lchild=NULL;
newnode->rchild=NULL;
return newnode;
}
struct node *insert(struct node *root, int data)
{
if(root == NULL)
return newn(data);
if(root->data<data)
root->rchild = insert(root->rchild,data);
if(root->data>data)
root->lchild = insert(root->lchild,data);
return root;
}
void inorder(struct node *root)
{
if(root == NULL)
return;
inorder(root->lchild);
printf("%d ",root->data);
inorder(root->rchild);
}
void preorder(struct node *root)
{
if(root == NULL)
return;
printf("%d ",root->data);
inorder(root->lchild);
inorder(root->rchild);
}
void postorder(struct node *root)
{
if(root == NULL)
return;
inorder(root->lchild);
inorder(root->rchild);
printf("%d ",root->data);
}
int main()
{
struct node *root = NULL;
int data;
while(1)
{
printf("\n1.insert\n2.inorder traversal\n3.preorder traversal\n4.postorder\n5.exit\n");
printf("enter option: ");
int choice;
scanf("%d",&choice);
switch (choice)
{
case 1 :
printf("\nEnter the value to be inserted\n");
scanf("%d",&data);
root = insert(root,data);
break;
case 2 :
printf("\nInorder Traversal of the Binary Tree:\n");
inorder(root);
break;
case 3 :
printf("\nPreorder Traversal of the Binary Tree:\n");
preorder(root);
break;
case 4 :
printf("\nPostorder Traversal of the Binary Tree:\n");
postorder(root);
break;
case 5 :
exit(0);
default :
printf("invalid option\n");
break;
}
}
return 0;
}