-
Notifications
You must be signed in to change notification settings - Fork 0
/
preorder.c
80 lines (69 loc) · 1.99 KB
/
preorder.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
#include<stdio.h>
#include<conio.h>
#include<malloc.h>
struct node
{
int data;
struct node *left;
struct node *right;
};
struct node *createnode(int data)
{
struct node *n=(struct node *)malloc(sizeof(struct node));
n->data=data;
n->left=NULL;
n->right=NULL;
return n;
}
int preorder(struct node *root)
{
if(root!=NULL)
{
printf("%d ",root->data);
preorder(root->left);
preorder(root->right);
}
}
int inorder(struct node *root)
{
if(root!=NULL)
{
inorder(root->left);
printf("%d ",root->data);
inorder(root->right);
}
}
int postorder(struct node *root)
{
if(root!=NULL)
{
postorder(root->left);
postorder(root->right);
printf("%d ",root->data);
}
}
int main()
{
struct node *p=createnode(4);
struct node *p1=createnode(2);
struct node *p2=createnode(1);
struct node *p3=createnode(7);
struct node *p4=createnode(5);
struct node *p5=createnode(8);
struct node *p6=createnode(3);
struct node *p7=createnode(6);
p->left=p1;
p->right=p2;
p1->left=p3;
p1->right=p4;
p2->left=p5;
p2->right=p6;
p3->left=p7;
preorder(p);
printf("\n");
inorder(p);
printf("\n");
postorder(p);
getch();
return 0;
}