public void Insert(T value) {

                //while (true)
                //{
                    if (_Value.CompareTo(value) > 0)
                    {

                        if (LeftChild == null)
                        {
                            LeftChild = new BinarySearchTreeNode<T>(value);
                            LeftChild.Parent = this;
                        }
                        else  LeftChild.Insert(value);
                    }

                    else if (_Value.CompareTo(value) <= 0)
                    {

                        if (RightChild == null)
                        {
                            RightChild = new BinarySearchTreeNode<T>(value);
                            RightChild.Parent = this;
                        }
                        else RightChild.Insert(value);
                        //this.Value = RightChild.Value;

                //}
           }
      }