C++数组实现二叉树遍历

2015/07/03 47990

清华大佬耗费三个月吐血整理的几百G的资源，免费分享！....>>>

?
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
# include
  
struct node
{
    int l,r;
};
struct node tree[100];
int path[100];
int ans;
void init()
{
    int i;
    ans = 0;
    for(i = 0 ; i < 100 ; i ++  )
        tree[i].l = tree[i].r = -1,path[i] = -1;
}
void preOrderTree(int root)
{
    if(root == -1 )
        return ;
    path[ans++] = root;
    preOrderTree(tree[root].l);
      
    preOrderTree(tree[root].r);
      
}
int main()
{
    int T,i,n;
    int root,a,b,c;
    scanf("%d",&T);
    while(T--)
    {
        init();
        scanf("%d",&n);
        scanf("%d",&root);
        for(i = 0 ; i < n -1; i ++)
        {
            scanf("%d%d%d",&a,&b,&c);
            if(c == 0)
            {
                tree[a].l = b;
            }
            else
            {
                tree[a].r = b;
            }
        }
        preOrderTree(root);
        for(i = 0 ; i < n ; i ++)
            printf("%d%c",path[i],i' ':'/n');
          
    }
    return 0;
}