C binary tree structure definition and node value addition

This article explains C# Binary tree structure definition 、 Add node value
///
/// The definition of binary tree
///
public class BiTNode
{
public BiTNode() { }
public int data;// Data fields
public BiTNode lchild;
public BiTNode rchild;
}
actual main Program testing
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();

    }