Binary Search try

[atown282]

I cannot get my insert function to work for my binary search tree. Says i need to return a value i dont know what to return

template <class DataType>
void BinarySearchTree<DataType>::Insert(const DataType & item)//BSTNode<DataType>*
{
   BSTNodePtr Current, Parent, NewNodePtr;

   Current = Root;
   Parent = NULL;
   while (Current != NULL)
      {
      Parent = Current;
      if (Item < Current->Info)
         Current = Current->Left;
      else
         Current = Current->Right;
      }

   NewNodePtr = GetNode(Item, NULL, NULL);
   if (Parent == NULL)
      Root = NewNodePtr;
   else if (Item < Parent->Info)
      Parent->Left = NewNodePtr;
   else
      Parent->Right = NewNodePtr;

   Count++;
   }
   
}
	
template <class DataType>
BSTNode<DataType>* BSTClass::GetNode(const DataType & item, BSTNode left, BSTNode right)
   {
   BSTNode<DataType>* NodePtr;

   NodePtr = new BSTNodeClass(Item, LeftPtr, RightPtr);
   if (NodePtr == NULL)
      {
      cerr << "Memory allocation error!" << endl;
      exit(1);
      }
   return NodePtr;
   }