4-3 Level-order Traversal (25分)

4-3 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) ){
	Tree a[100];
	if(T==NULL)
	return;
	int top=0;
	int end=0;
	a[top++]=T;
	while(top!=end){
		visit(a[end]);
		if(a[end]->Left)
		a[top++]=a[end]->Left;
		if(a[end]->Right)
		a[top++]=a[end]->Right;
		end++;
	}
}
感想：这道题注意两点1.用队列处理，可以像我一样用数组模拟队列2.注意处理T==NULL的情况