Esempio n. 1
0
        public bool Find(int item)
        {
            //return Find(item, root);

            BSNode temp = root;

            while (true)
            {
                if (temp == null)
                {
                    return(false);
                }
                if (temp.Data == item)
                {
                    return(true);
                }
                if (item > temp.Data)
                {
                    temp = temp.RightChild;
                }
                else
                {
                    temp = temp.LeftChild;
                }
            }
        }
Esempio n. 2
0
        public bool Delete(int item)
        {
            BSNode temp = root;

            while (true)
            {
                if (temp == null)
                {
                    return(false);
                }
                if (temp.Data == item)
                {
                    Delete(temp);
                    return(true);
                }
                if (item > temp.Data)
                {
                    temp = temp.RightChild;
                }
                else
                {
                    temp = temp.LeftChild;
                }
            }
        }
Esempio n. 3
0
 private bool Find(int item, BSNode node)
 {
     if (node == null)
     {
         return(false);
     }
     if (node.Data == item)
     {
         return(true);
     }
     else
     {
         //if (Find(item, node.LeftChild))
         //{
         //    return true;
         //}
         //if (Find(item, node.RightChild))
         //{
         //    return true;
         //}
         if (item > node.Data)
         {
             return(Find(item, node.RightChild));
         }
         else
         {
             return(Find(item, node.LeftChild));
         }
     }
 }
Esempio n. 4
0
        private void MiddleTraversal(BSNode node)
        {
            if (node == null)
            {
                return;
            }

            MiddleTraversal(node.LeftChild);
            Console.Write(node.Data + " ");
            MiddleTraversal(node.RightChild);
        }
Esempio n. 5
0
        public void Delete(BSNode node)
        {
            if (node.LeftChild == null && node.RightChild == null)
            {
                if (node.Parent == null)
                {
                    root = null;
                    //node = null;//也是不行的
                }
                else if (node.Parent.LeftChild == node)
                {
                    node.Parent.LeftChild = null;
                    //node = null;
                }
                else if (node.Parent.RightChild == node)
                {
                    node.Parent.RightChild = null;
                }
                return;
            }
            if (node.LeftChild == null && node.RightChild != null)
            {
                node.Data       = node.RightChild.Data;
                node.RightChild = null;
                return;
            }
            if (node.LeftChild != null && node.RightChild == null)
            {
                node.Data      = node.LeftChild.Data;
                node.LeftChild = null;
                return;
            }

            BSNode temp = node.RightChild;

            while (true)
            {
                if (temp.LeftChild != null)
                {
                    temp = temp.LeftChild;
                }
                else
                {
                    break;
                }
            }
            node.Data = temp.Data;
            Delete(temp);
        }
Esempio n. 6
0
        //添加数据
        public void Add(int item)
        {
            BSNode newNode = new BSNode(item);

            if (root == null)
            {
                root = newNode;
            }
            else
            {
                BSNode temp = root;
                while (true)
                {
                    if (item >= temp.Data)//放在temp的右边
                    {
                        if (temp.RightChild == null)
                        {
                            temp.RightChild = newNode;
                            newNode.Parent  = temp;
                            break;
                        }
                        else
                        {
                            temp = temp.RightChild;
                        }
                    }
                    else//放在temp的左边
                    {
                        if (temp.LeftChild == null)
                        {
                            temp.LeftChild = newNode;
                            newNode.Parent = temp;
                            break;
                        }
                        else
                        {
                            temp = temp.LeftChild;
                        }
                    }
                }
            }
        }