Thread: Linked lists questions

so i would insert the first number in the head outside of the insertion function. Then in the insertion function it would take that head in, then add more numbers to the list until 0 is entered. is this the order?

ok, i think i get that. for the sort, how would i get it repeat itself ?

Code:

do 
{
cout << "Please insert the first number : " ;
cin >> number ;
insertion(HeadPtr, number);
 
} while (number!=0);

I know this is getting repetitive. Pretty ridiculous, i need a Live breathing teacher, If anyone is out there PLEASE pm me. I am willing to pay you for your time. Me paying you will save me money actually. I am not sure on the rules of the website about asking for help, im very desperateactually. have 2 assignments and a final in about 3 weeks. and still dont see everything the book is trying to teach, and the online teacher doesnt clarify.

anyway,

My program is falling apart. I'm talking very bad. i scrapped the whole thing because i had to change the insertion.
The goal of what i am looking to do is one thing, then i can move on to something else .
Insert a number in if the HeadPtr is empty or NULL.

I've tried
if (HeadPtr==NULL)
{
do something;
}

and

if (HeadPtr==0)
{
do something;
}

what is it that is needed to get to the inside of the if statement?

this is the whole program i am starting over with.

Code:

#include <iostream>
using namespace std;

/* Recursive functions
insertion
retrieval
pointer based sorted linked list of integers
also if 0 is entered it keeps inserting until 0 is entered.
*/


struct node
{
   int item;
   node *next;
};


// takes in the head pointer 
// item to be inserted
//building the list here

void insertion(node *HeadPtr, int NumberToInsert) 
{

if (HeadPtr=NULL) //If the HeadPtr is empty insert the number
{

HeadPtr->item=NumberToInsert;
cout << "The HeadPtr->item is : " << HeadPtr->item << endl;
} //end if

}

void traverser (node *HeadPtr) {
     cout << "Using Traverser the HeadPtr->item is :" << HeadPtr->item << endl;
}

int main() {
int number;
node *HeadPtr=new node;
HeadPtr==NULL;

while (number!=0) 
{
cout << "Please insert the first number: "; 
cin >> number;
}
insertion( HeadPtr, number);
//traverser(HeadPtr);
   system("pause");
    return 0;
}