6-4 Level-order Traversal （25 分）

6-4 Level-order Traversal （25 分）

Write a routine to list out the nodes of a binary tree in “level-order”. List the root, then nodes at depth 1, followed by nodes at depth 2, and so on. You must do this in linear time.

Format of functions:

void Level_order ( Tree T, void (*visit)(Tree ThisNode) );

where void (*visit)(Tree ThisNode) is a function that handles ThisNode being visited by Level_order, and Tree is defined as the following:

typedef struct TreeNode *Tree;
struct TreeNode {
    ElementType Element;
    Tree  Left;
    Tree  Right;
};

Sample program of judge:

#include <stdio.h>
#include <stdlib.h>

#define MaxTree 10 /* maximum number of nodes in a tree */
typedef int ElementType;

typedef struct TreeNode *Tree;
struct TreeNode {
    ElementType Element;
    Tree  Left;
    Tree  Right;
};

Tree BuildTree(); /* details omitted */
void PrintNode( Tree NodePtr )
{
   printf(" %d", NodePtr->Element);
}

void Level_order ( Tree T, void (*visit)(Tree ThisNode) );

int main()
{
    Tree T = BuildTree();
    printf("Level-order:");
    Level_order(T, PrintNode);
    return 0;
}

/* Your function will be put here */

Sample Output (for the tree shown in the figure):

Level-order: 3 5 6 1 8 10 9
由于是函数题，不要求编出全部程序，所以可以不用管输入，只要负责输出即可。本题中采用的是二叉树中层次输出的方式，所以代码为：

void Level_order ( Tree T, void (*visit)(Tree ThisNode) )
{
    //visit=PrintNode;
    if(T==NULL)return;
    Tree CC[10000];
    CC[0]=T;
    int lens=1;
    while(true)
    {
        if(lens==0)return;
        int temp=0;Tree TH[10000];
        for(int i=0;i<lens;i++)
        {
            if(CC[i]!=NULL)
                (*visit)(CC[i]);
            if(CC[i]->Left!=NULL)
                TH[temp++]=CC[i]->Left;
            if(CC[i]->Right!=NULL)
                TH[temp++]=CC[i]->Right;
        }
        lens=temp;
        for(int i=0;i<lens;i++)
            CC[i]=TH[i];
    }
}