数据结构 函数题6.11

6-11 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 */

void Level_order ( Tree T, void (*visit)(Tree ThisNode) )
{
	Tree a[2005];
	int cnt,num;
	cnt=num=0;
	if(!T) return;
	a[cnt++]=T;
	while(num<cnt)
	{
		visit(a[num]);
		if(a[num]->Left) a[cnt++]=a[num]->Left;
		if(a[num]->Right) a[cnt++]=a[num]->Right;
		num++;
	}
}

`