二叉树顺序遍历:
1precedure preorder(i:integer);
2begin
3if i<>0 then
4 begin
5 deal(tree[i].data);
6 preorder(tree[i].left);
7 preorder(tree[i].right);
8 end;{then}
9end.{preorder}
10
11precedure inorder(i:integer);
12begin
13if i<>0 then
14 begin
15 inorder(tree[i].left);
16 deal(tree[i].data);
17 inorder(tree[i].right);
18 end.{then}
19end.{inorder}
20
21precedure postorder(i:integer);
22begin
23if i<>0 then
24 begin
25 postorder(tree[i].right);
26 postorder(tree[i].left);
27 deal(tree[i].data);
28 end;{then};
29end.{postorder};
30
2begin
3if i<>0 then
4 begin
5 deal(tree[i].data);
6 preorder(tree[i].left);
7 preorder(tree[i].right);
8 end;{then}
9end.{preorder}
10
11precedure inorder(i:integer);
12begin
13if i<>0 then
14 begin
15 inorder(tree[i].left);
16 deal(tree[i].data);
17 inorder(tree[i].right);
18 end.{then}
19end.{inorder}
20
21precedure postorder(i:integer);
22begin
23if i<>0 then
24 begin
25 postorder(tree[i].right);
26 postorder(tree[i].left);
27 deal(tree[i].data);
28 end;{then};
29end.{postorder};
30