•
•
•
•
What is DaniWeb IT Discussion Community?
You're currently browsing the C++ section within the Software Development category of DaniWeb, a massive community of 402,446 software developers, web developers, Internet marketers, and tech gurus who are all enthusiastic about making contacts, networking, and learning from each other. In fact, there are 2,998 IT professionals currently interacting right now! Registration is free, only takes a minute and lets you enjoy all of the interactive features of the site.
Please support our C++ advertiser: Programming Forums
Views: 8885 | Replies: 3
![]() |
•
•
Join Date: Jan 2006
Posts: 3
Reputation:
Rep Power: 0
Solved Threads: 0
hey guys, im a new guy here in the forum and im also an IT student who gets into C++ troubles most of the time, but enough about that... i just wanna ask if anyone can help me in my linked list problem, i think its about pointers and address. like a->link, well thats what it looked like. Problem is i dont understand a thing and my prof wont even give me an example, i dont even get the slightest idea of what's it all about and i dont know where to start, SO CAN ANYONE PLS SHOW ME AN EXAMPLE,even just the basic ones THANKS!!!
^_^
^_^
•
•
Join Date: Dec 2005
Location: Pleasanton, CA
Posts: 43
Reputation:
Rep Power: 3
Solved Threads: 0
Linked list are typically used to work with data structures.
Access to items in the list is controlled by pointers.
This is a very simple example to construct a linked list. You will need to do a lot more reading to use them correctly.
One thing to remember:
You must delete all the list items when exiting the program otherwise you will create a memory leak.
Access to items in the list is controlled by pointers.
This is a very simple example to construct a linked list. You will need to do a lot more reading to use them correctly.
One thing to remember:
You must delete all the list items when exiting the program otherwise you will create a memory leak.
struct dataRec {
type data;
dataRec *next;
}
dataRec *prList = NULL; // the list anchor
function addRecord(dataRec *prList) {
dataRec *temp = new dataRec; // create a new record to add to list
temp->data = whatever;
temp->next = NULL;
// Now add this record to the end of the list
dataRec *curr = prList;
if (curr == NULL) { // the list is empty
prList = temp; // prList, the anchor, now points to the first record
}
else {
if (curr->next == NULL) { // last record in list
curr->next = temp; // add temp to end of list
}
else { // move up the list until the last entry
curr = curr->next;
}
}
}![]() |
•
•
•
•
•
•
•
•
DaniWeb C++ Marketplace
•
•
•
•
Currently Active Users Viewing This Thread: 1 (0 members and 1 guests)
Similar Threads
- Removing an item from head of linked list (C)
- help implementing singly linked list (C++)
- How to read in a sentence and insert in to linked list? (C++)
- Linked List using pointers (C++ ADT) (C++)
- Why doesn't this remove the last node in a linked list? (C++)
- Cannot figure out how to implement linked list and rbtree for a project! (Java)
- Linked List (C++)
- help by sorting a simply linked list (C)
Other Threads in the C++ Forum
- Previous Thread: Using C++ OOP class.....
- Next Thread: Creating data packets?



Linear Mode