I've been working on my destructor for a linked list project where even numbers are inserted in the front and odd numbers are inserted in the back. Deletion works on a last in first out depending on if it is odd or even. I have everything working but I keep getting an error when I run my destructor. I've walked through the debug and it deletes all of the nodes but then crashes afterwards and I'm not sure why. Here is my code:
//Headerfile
class Staque
{
private:
struct staqueNode
{
int value;
struct staqueNode *next;
struct staqueNode *prev;
};
staqueNode *root;
public:
Staque();
~Staque();
void addNode(int addIn);
void deleteNode(int oddIn, int evenIn);
void display();
};
//header.cpp file
#include"Staque.h"
#include<iostream>
using namespace std;
Staque::Staque()
{
root = NULL;
}
void Staque::addNode(int addIn)
{
staqueNode *newNode;
staqueNode *nodePtr;
staqueNode *temp = NULL;
newNode = new staqueNode;
newNode->value = addIn;
newNode->next = NULL;
newNode->prev = NULL;
if (!root)
{
root = newNode;
}
else
{
if (newNode->value % 2 == 0)
{
nodePtr = root;
while (nodePtr->next)
{
nodePtr = nodePtr->next;
}
nodePtr->next = newNode;
newNode->prev = nodePtr;
}
else if (newNode->value % 2 != 0)
{
nodePtr = root;
while (nodePtr->prev)
{
nodePtr = nodePtr->prev;
}
nodePtr->prev = newNode;
newNode->next = nodePtr;
}
}
}
void Staque::deleteNode(int oddIn, int evenIn)
{
staqueNode *nodePtr;
staqueNode *temp = NULL;
if (!root)
return;
while (evenIn > 0)
{
nodePtr = root;
while (nodePtr != NULL && nodePtr->next != NULL)
{
temp = nodePtr;
nodePtr = nodePtr->next;
}
if (nodePtr == root && root->value % 2 == 0)
{
root = root->prev;
temp->next = NULL;
delete nodePtr;
evenIn = 0;
}
else
{
temp->next = NULL;
delete nodePtr;
evenIn -= 1;
}
}
while (oddIn > 0)
{
nodePtr = root;
while (nodePtr != NULL && nodePtr->prev != NULL)
{
temp = nodePtr;
nodePtr = nodePtr->prev;
}
if (nodePtr == root && root->value % 2 != 0)
{
root = root->next;
temp->prev = NULL;
delete nodePtr;
oddIn = 0;
}
else
{
temp->prev = NULL;
delete nodePtr;
oddIn -= 1;
}
}
}
void Staque::display()
{
staqueNode *nodePtr;
nodePtr = root;
while (nodePtr->next)
{
nodePtr = nodePtr->next;
}
cout << "\nThe staque: ";
while (nodePtr->prev)
{
cout << nodePtr->value << " ";
nodePtr = nodePtr->prev;
}
cout << nodePtr->value << endl;
}
Staque::~Staque()
{
staqueNode *nodePtr;
staqueNode *temp;
nodePtr = root;
while (nodePtr->next)
{
temp = nodePtr;
nodePtr = nodePtr->next;
}
//nodePtr = root;
while (nodePtr->prev)
{
temp = nodePtr;
nodePtr = nodePtr->prev;
delete temp;
}
//delete root;
}
//source/main.cpp
#include"Staque.h"
#include<iostream>
using namespace std;
int main()
{
Staque myList;
int choice;
int input;
int numOdd;
int numEven;
do
{
cout << "Would you like to: \nAdd a node: 1\nDelete a node: 2\nDisplay the list: 3\nQuit: 0\n";
cin >> choice;
while (choice < 0 || choice > 3)
{
cout << "Invalid Input: Would you like to: \nAdd a node: 1\nDelete a node: 2\nDisplay the list: 3\nQuit: 0\n";
cin >> choice;
}
switch (choice)
{
case 1:
cout << "Enter the value you would like to add to the list: ";
cin >> input;
while (isalpha(input))
{
cout << "Invalid input: Enter the value you would like to add to the list: ";
cin >> input;
}
myList.addNode(input);
myList.display();
break;
case 2:
cout << "Enter the number of even numbers you would like to delete: ";
cin >> numEven;
while (isalpha(input) || numEven < 0)
{
cout << "Invalid input: Enter the number of even numbers you would like to delete: ";
cin >> numEven;
}
cout << "Enter the number of odd numbers you would like to delete: ";
cin >> numOdd;
while (isalpha(input) || numEven < 0)
{
cout << "Invalid input: Enter the number of odd numbers you would like to delete: ";
cin >> numOdd;
}
myList.deleteNode(numOdd, numEven);
myList.display();
break;
case 3:
myList.display();
break;
default:
break;
}
} while (choice != 0);
myList.~Staque();
return 0;
}
