Thread: i need a bit of help .....

hi guys !
the problem i am dealing with is regarding linked lists. phewwwwww! i am stuck with these pointers the thing is that i am unable to make the insEnd() function of the linked lists that inserts a node at the end of the list. Problem is that i lose the pointer to the first node ,so only last info is available. actually i am making lists that can work on few string functions. ill tell thier details later but the main problem is that how do i akeep track of the first pointer. ...? plz if anyone could help me in making that or anyone has done a project or assignment like that help mee!
waiting...

Implement :

node *Head;
node *Current;
node *Tail;

In your Linked List class or main();

If your inserting nodes on the end, you shouldn't be losing the first node (or any nodes for that matter). If you are (like you said) you're not adding them onto the end of the list properly.

essentially your Tail->next=whatever.your.pointing.to;

p.s.
Posting revelent code always helps.

It can be done in any number of ways. Here's one that doesn't use a list class, doesn't use a tail node, and isn't "functionalized", although those are all valid options, and something you should think about.

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

int main()
{
node * head = NULL;//the list
node * current;

//get a new node
node * newNode = new Node;

//initialize the new node:
newNode->data = 14;
newNode->next = NULL:

//insert at end of list
//first find end of list, starting at head and moving down
current = head;
while(current->next != NULL)
{
current = current->next;
}

//then figure out where you are before doing anything.
if(current == head) //means list was empty
{
head = newNode;
}
else //list wasn't empty
{
current->next = newNode;
}

//etc.

thanks for ur help guys ! i 've been able to sought it now ! i'll probably ask again if i am stuck in upcoming trees assignment ...