Data_Structures_and_Algorithms/Binary_tree_traversal.pas at main · tomiirossi/Data_Structures_and_Algorithms · GitHub

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
program tree;
type
	tree = ^node;
	node = record
 		data:integer;
		cl:tree;
		cr:tree;
		end;
procedure add(var t:tree;n:integer);
begin
	if (t = nil) then
	begin
		new(t);
		t^.data:=n;
		t^.cl:=nil;
		t^.cr:=nil;
	end
	else
	begin
		if (t^.data<=n) then
			add(t^.cl,n);
		else
			add(t^.cr,n);
	end;
end;
//procedure preorder(t:tree);
//begin
	//if (t<>nil) then
	//begin
		//writeln(t^.data);
		//preorder(t^.cl);
		//preorder(t^.cr);
	//end;
//end;
//procedure postorder(t:tree);
//begin
	//if (t<>nil) then
	//begin
		//postorder(t^.cl);
		//postorder(t^.cr);
		//writeln(t^.data);
	//end;
//end;

procedure inOrder(t:tree);
begin
	if (t<>nil) then begin
		inOrder(t^.cl);
		writeln(t^.data);
		inOrder(t^.cr);
	end;
end;
var
	trees:tree;
 	num:integer;
begin
	trees:=nil;
	readln(num);
	while (num<>50) do
	begin
		add(trees,num);
		readln(num);
	end;
	inOrder(a);
  //postorder(a);
  //preorder(a);
end.