/
PremReversInorderTree.c
87 lines (77 loc) · 1.23 KB
/
PremReversInorderTree.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
#include<stdio.h>
#include<stdlib.h>
typedef struct _node
{
struct _node* left;
struct _node* right;
int ele;
}node;
node* createNode(int elem)
{
node* newnode = (node*)malloc(sizeof(node));
newnode->ele = elem;
newnode->left = NULL;
newnode->right = NULL;
return newnode;
}
void insertInTree(node* root,int elem)
{
if(root->ele == elem)
return;
if(root->ele < elem)
{
if(root->right==NULL)
root->right = createNode(elem);
else
insertInTree(root->right,elem);
}
else
{
if(root->left==NULL)
root->left = createNode(elem);
else
insertInTree(root->left,elem);
}
return;
}
void printTree(node* root)
{
if(root == NULL)
return;
printTree(root->left);
printf("%d\t",root->ele);
printTree(root->right);
}
int sum = 0;
void sumTree(node* t)
{
if(t==NULL)
return ;
sumTree(t->right);
int temp = t->ele;
t->ele = sum;
sum += temp;
sumTree(t->left);
return;
}
int main() {
int n;
scanf("%d",&n);
node* root = NULL;
int elem,i;
for(i=0; i<n; i++)
{
scanf("%d",&elem);
if(root == NULL)
root = createNode(elem);
else
insertInTree(root, elem);
}
printf("Printing Tree:\n");
printTree(root);
printf("\n");
printf("After Reversal called:\n");
sumTree(root);
printTree(root);
return 0;
}