BinaryNode* BinarySearchTree::search(LoQnode find, BinaryNode* start)
{
	if start!=NULL
	{
		if (find.getLength()<start->getLabel())
			search(find,start->getLeftChild());
		if (find.getLength()>start->getLabel())
			search(find,start->getRightChild());
		if (find.getLength()==start->getLabel())
		{
			if (find==*(start->getContent()))
				return start;
			else search(find,start->getRightChild());
		}
	}
	return NULL;
};