C ＃ realizes the first order traversal, middle order traversal and second order traversal of binary tree

In this paper, C# The implementation of binary tree traversal 、 In the sequence traversal 、 After the sequence traversal
1、 The first sequence traversal
///
/// The first sequence traversal
///
///
static void PreOrder(BiTNode T) {
if (T!=null) {
visit(T);
PreOrder(T.lchild);
PreOrder(T.rchild);
}
2、 In the sequence traversal
///
/// In the sequence traversal
///
///
static void InOrder(BiTNode T)
{
if (T != null)
{

            InOrder(T.lchild);
            visit(T);
            InOrder(T.rchild);
        }

    }

3、 After the sequence traversal
///
/// After the sequence traversal
///
///
static void PostOrder(BiTNode T)
{
if (T != null)
{

            PostOrder(T.lchild);

            PostOrder(T.rchild);
            visit(T);
        }

    }

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

The test of main Function as follows
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();

    }