Binary Tree二叉树

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Collections;//

namespace ArrayAndArrayList
{
public class Node
{
public int Data;
public Node Left;
public Node Right;

public void DisplayNode()
{
Console.Write(Data+" ");
}
}

///

///
///

public class BinarySearchTree
{
public Node root;
public BinarySearchTree()
{
root = null;
}
public void Insert(int i)
{
Node newNode = new Node();
newNode.Data = i;
if (root == null)
{
root = newNode;
}
else
{
Node current = root;
Node parent;
while (true)
{
parent = current;
if (i < current.Data)
{
current = current.Left;
if (current == null)
{
parent.Left = newNode;
break;
}
}
else
{
current = current.Right;
if (current == null)
{
parent.Right = newNode;
break;
}
}

}
}
}

public void InOrder(Node theRoot)
{
if (theRoot != null)
{
InOrder(theRoot.Left);
theRoot.DisplayNode();
InOrder(theRoot.Right);
}
}

public void PreOrder(Node theRoot)
{
if (theRoot != null)
{
theRoot.DisplayNode();
PreOrder(theRoot.Left);
PreOrder(theRoot.Right);
}
}

public void PostOrder(Node theRoot)
{
if (theRoot != null)
{
PostOrder(theRoot.Left);
PostOrder(theRoot.Right);
theRoot.DisplayNode();
}
}

public void FindMin()
{
Node current = root;
while (current.Left != null)
{
current = current.Left;
}
Console.WriteLine(current.Data);
}
public void FindMax()
{
Node current = root;
while (current.Right != null)
{
current = current.Right;
}

Console.WriteLine(current.Data);
}
}

class Program
{
static void Main(string[] args)
{
BinarySearchTree nums = new BinarySearchTree();
nums.Insert(23);
nums.Insert(45);
nums.Insert(16);
nums.Insert(37);
nums.Insert(3);
nums.Insert(99);
nums.Insert(22);
nums.InOrder(nums.root);
Console.WriteLine("~~~~~~~~~~~~~~~~~~~");
nums.PreOrder(nums.root);
Console.WriteLine("~~~~~~~~~~~~~~~~~~~");
nums.PostOrder(nums.root);
Console.WriteLine("~~~~~~~~~~~~~~~~~~~");
nums.FindMin();
Console.WriteLine("~~~~~~~~~~~~~~~~~~~");
nums.FindMax();
}
}
}