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
|
funcprot(0);
function[tree]=maketree(x)
tree=zeros(30,1);
for i=1:30
tree(i)=-1;
end
tree(1)=x;
tree(2)=-2;
endfunction
function[tree1]=setleft(tree,tre,x)
tree1=[];
i=1;
while(tree(i)~=-2)
if(tree(i)==tre)
j=i;
end
i=i+1;
end
if(i>2*j)
tree(2*j)=x;
else
tree(2*j)=x;
tree(2*j+1)=-2;
for l=i:2*j-1
tree(i)=-1;
end
end
tree1=tree;
endfunction
function[tree1]=setright(tree,tre,x)
tree1=[];
i=1;
while(tree(i)~=-2)
if(tree(i)==tre)
j=i;
end
i=i+1;
end
if(i>2*j+1)
tree(2*j+1)=x;
else
tree(2*j+1)=x;
tree(2*j+2)=-2;
for l=i:2*j
tree(i)=-1;
end
end
tree1=tree;
endfunction
function[x]=isleft(tree,tre)
i=1;
x=0;
while(tree(i)~=-2)
if(tree(i)==tre)
j=i;
end
i=i+1;
end
if(i>=2*j)
if((tree(2*j)~=-1)|(tree(2*j)~=-2))
x=1;
return 1;
else
return 0;
end
else
x=0;
return x;
end
endfunction
function[x]=isright(tree,tre)
i=1;
x=0;
while(tree(i)~=-2)
if(tree(i)==tre)
j=i;
end
i=i+1;
end
if(i>=2*j+1)
if((tree(2*j+1)~=-1)|(tree(2*j+1)~=-2))
x=1;
return 1;
else
return 0;
end
else
x=0;
return x;
end
endfunction
funcprot(0);
function[]=inorder(tree,p)
if(tree(p)==-1|tree(p)==-2)
return;
else
inorder(tree,2*p);
printf("%d\t",tree(p));
inorder(tree,2*p+1);
end
endfunction
function[]=preorder(tree,p)
if(tree(p)==-1|tree(p)==-2)
return;
else
printf("%d\t",tree(p));
preorder(tree,2*p);
preorder(tree,2*p+1);
end
endfunction
function[]=postorder(tree,p)
if(tree(p)==-1|tree(p)==-2)
return;
else
postorder(tree,2*p);
postorder(tree,2*p+1);
printf("%d\t",tree(p));
end
endfunction
//Calling Routine:
tree=maketree(3);
tree=setleft(tree,3,1);
tree=setright(tree,3,2);
tree=setleft(tree,2,4);
tree=setright(tree,2,5);
disp("Inorder traversal");
inorder(tree,1);
disp("Preorder traversal");
preorder(tree,1);
disp("Postorder traversal");
postorder(tree,1);
|
