一棵C#写的树(1) he_x（原作）

if(t==null) return;

RevOrderTravel(t.Left);

RevOrderTravel(t.Right);

Print(t);

}

public void Print(IBinNode t)

{

Console.Write(t.Element + ",");

}

public void Insert(IBinNode node,Position pos)

{

if(node == null)

throw(new InvalidOperationException("不能将空节点插入树"));

switch(pos)

{

case Position.LEFT : tree.Left = node;break;

case Position.RIGHT: tree.Right = node;break;

}

}

/// <summary>

/// 按照先序遍历顺序遍历树

/// </summary>

public void TreeBuilder()

{

Stack stk = new Stack(INIT_TREE_SIZE);

stk.Push(tree);

Position pos;

string para;

pos = Position.LEFT;

IBinNode baby,temp;

while(true)

{

para = Console.ReadLine();