C ＃ realize the hierarchical traversal of binary tree

This article explains C# Realize the level traversal of binary tree
1、 /// Level traversal
///
/// Level traversal
///
///
static void LevelOrder(BiTNode T) {
SqQueue Q = new SqQueue();
Q.data = new BiTNode[MaxSize];
InitQueue(ref Q);
BiTNode p = null;
EnQueue(ref Q, T);
while (!isEmpty(Q)) {
DeQueue(ref Q, ref p);
visit§;
if (p.lchild!=null) { EnQueue(ref Q, p.lchild); }
if (p.rchild!=null) { EnQueue(ref Q,p.rchild); }
}
}

2、 Node value access
///
/// Output of node value
///
static void visit(BiTNode T) {
Console.Write(T.data+" ");
}

3、 Queue structure
///
/// Queue structure definition
///
public struct SqQueue
{
public BiTNode[] data;// Queued elements
public int front, real;// Team leader and team leader
}
///
/// Queue initialization
///
///
static void InitQueue(ref SqQueue Q)
{
Q.real = Q.front = 0;
}
///
/// Determines if the queue is empty
///
///
///
static bool isEmpty(SqQueue Q)
{
if (Q.front == Q.real) { return true; }
else return false;
}
///
/// The team
///
///
///
///
static bool EnQueue(ref SqQueue Q, BiTNode x)
{
if ((Q.real + 1) % MaxSize == Q.front) { return false; }
Q.data[Q.real] = x;
Q.real = (Q.real + 1) % MaxSize;
return true;
}
///
/// Out of the team
///
///
///
///
static bool DeQueue(ref SqQueue Q, ref BiTNode x)
{
if (Q.real == Q.front) { return false; }
x = Q.data[Q.front];
Q.front = (Q.front + 1) % MaxSize;
return true;
}
4、 actual main Function test
public const int MaxSize = 50;
static void Main(string[] args)
{
BiTNode T = new BiTNode() ;
int x=0;
// Create a binary tree
T.data = 1;
T.lchild= new BiTNode();
T.lchild.data = 2;
T.rchild = new BiTNode();
T.rchild.data = 3;
T.lchild.rchild=new BiTNode();
T.lchild.rchild.data = 4;
T.lchild.rchild.lchild= new BiTNode();
T.lchild.rchild.lchild.data = 6;
T.rchild.rchild = new BiTNode();
T.rchild.rchild.data = 5;
Console.WriteLine(“ The value of traversal first ：”);
PreOrder(T);
Console.WriteLine();
Console.WriteLine(“ The value of middle order traversal ：”);
InOrder(T);
Console.WriteLine();
Console.WriteLine(“ The value of post order traversal ：”);
PostOrder(T);
Console.WriteLine();
Console.WriteLine(“ The value of an ordered traversal in non recursion ：”);
InOrder2(T);
Console.WriteLine();
Console.WriteLine(“ Value of hierarchy traversal ：”);
LevelOrder(T);
Console.ReadLine();

    }