typedef struct TreeNode *BinTree;typedef	BinTree Position; struct TreeNode{	ElementType Data;	BinTree Left;	BinTree Right; }; BinTree BT;void LevelOrderTraversal( BinTree BT )//二叉樹的層序遍歷，用隊列方法，一層一層訪問的{	Queue Q;BinTree T;	if(!BT) return;//若是空樹則直接返回	Q=CreateQueue(MaxSize);//創建并初始化隊列Q	AddQ(Q,BT);	while(!IsEmptyQ(Q)){		T=DeleteQ(Q);		PRintf("%d/n",T->Data);//訪問取出隊列的結點		if(T->Left) AddQ(Q,T->Left);		if(T->Right)  AddQ(Q,T->Right);	} }