C#二叉树

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

namespace Sort
{
    class Tree
    {
        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.Insert(23);

            Console.WriteLine("Inorder traversasl:");
            nums.InOrder(nums.root);
            Console.ReadKey();

        }
    }

    public class Node
    {
        public int Data;

        public Node Left = null;
        public Node Right = null;

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

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


        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;
                        }
                    }
                } 
            }
        }

    }
}