My recursive insert method seems to be dropping the rest of the list. Can I get some feedback on how to properly add into a sorted linkedlist recursively??? Thank you!
void insertRecursively(Node<int>*& head, int item)
{
Node<int>* newNode = new Node<int>(item);
Node<int>* curPtr = head;
Node<int>* prev;
if(curPtr != nullptr && item < curPtr -> getItem())
{
prev = curPtr;
curPtr = curPtr -> getNext();
insertRecursively(curPtr, item);
}
else
{
if(curPtr == nullptr)
{
newNode -> setNext(head);
head = newNode;
}
else
{
prev -> setNext(curPtr);
curPtr -> setNext(newNode);
}
}
}
Aucun commentaire:
Enregistrer un commentaire