(C# Binary Tree) 基本概念和算法

    public class BtNode
    {
        public int Data { get; set; }

        public BtNode Left { get; set; }

        public BtNode Right { get; set; }

        public void DisplayNode()
        {
            Console.Write("Data: {0}, ", this.Data); 
        }
    }

    public class BinarySearchTree
    {
        private BtNode root = null; 

        public void Insert(int data)
        {
            BtNode newNode = new BtNode(); 
            if (this.root == null)
            {
                this.root = newNode; 
            }
            else
            {
                // Add to children nodes.
                BtNode current = new BtNode();
                BtNode parent = new BtNode(); 

                while(true)
                {
                    parent = current; 
                    if (data < current.Data)
                    {
                        current = current.Left; 
                        if (current == null )
                        {
                            parent.Left = newNode; 
                            break; 
                        }
                        
                    }
                    else
                    {
                        current = current.Right; 
                        if (current == null)
                        {
                            parent.Right = newNode;
                            break; 
                        }
                    }
                }
            }
        }
    }