Linked List help

**Bad_Scooter** · 03-06-2003

I as having some trouble with linked list. What I am basically trying to do is create a doubly linked list with 10 nodes. Each node represents a frame of bowling. Since I am not adding or removing nodes throughout the program a vector seems like a better choice to me, but its not up to me.

First I just want to create a list with ten nodes (frames). This is what I have (pertaining to this issue, I have more):

frame *head; //declarations in class header
frame *back;
---------------------------------------------------
int e=0;
head = new frame;
while (e<9)
{
head->next =new frame;
e++;
}

----------------------------------------------------
player:

layer() //constructor in class player
{
head = new frame;
head->score=0;
head->ball1=0;
head->ball2=0;
head->ball3=0;
back = head;
}

----------------------------------------------------

declarations is frame:

class frame
{
public:

int score;
int ball1;
int ball2;
int ball3;
frame *prev;
frame *next;
};

I've tried to cut out a lot of the program and just get to the heart of the matter. All I am really asking is is this a proper way to build a linked list? I am having trouble visualizing the list. My program actually goes through this section, but doesn't assign my constructor values to each frame. Also any suggestions on how to move my pointer along through a list. Still a little shakey on pointers. A generic answer, or one using these examples would be appreciated. Thanks for reading.......

**hk_mp5kpdw** · 03-06-2003

I think this should help you to build the list if I didn't make any stupid mistakes. You should always remember to initialize all of those next and prev pointers as soon as possible after creating the nodes using new or you could end up in trouble later on if you forget.

Code:

frame *head; //declarations in class header
frame *back;
---------------------------------------------------
int e=0;
head = new frame;
head->prev = NULL;    // Should always get into the habit of initializing you pointers
head->next = NULL;    // Initialize pointer
back = head;
while( e++ < 9 )
{
    back->next = new frame;      // Add new node to end
    back->next->prev = back;    // Set new nodes prev pointer to point to previous last node
    back->next->next = NULL;    // Initialize new nodes next pointer
    back = back->next;          // Bump up our last node to the newly created node
}

**Bad_Scooter** · 03-06-2003

Thanks for the quick reply. That helps alot in my understanding, I really didn't have a good example to work through before.

Thread: Linked List help

Thread Tools

Search Thread

Display

Linked List help

Thanks

Similar Threads

C++ Linked list program need help !!!

Following CTools

Reverse function for linked list

Template Class for Linked List

singly linked list