anyone have linked-list sample codes?

Any one have some simple sample codes for Linked-List codes? because from the examples I found from books, they mostly only declare integer data inside the node.

What I concern is, I need an example which have declare a character (e.g : char name[30]) data inside the node.

Thank you so much.

:)

I don't really understand why the data type of the node would effect your understanding of the data structure. Is there a more specific issue you need help with?

P.S There are many many examples of linked lists found all over the web.

Ah the beauty of STL:

Code:

---

#include <list>    // For the list object
#include <cstring>  // For strncpy
#include <iostream> // For endl and cout

using namespace std;

struct node
{
    char data[30];
    node( char* info ) // Constructor for node struct
    {
        strncpy( data, info, 30 );
    };
};

int main()
{
    list<node> NodeList;            // Linked list of nodes
    list<node>::iterator itList;    // To loop though the nodes

    // Build a linked list of nodes with some character strings.

    NodeList.push_back( node("Hello, today") );
    NodeList.push_back( node("is the") );
    NodeList.push_back( node("3rd of July.") );

    // Go through the linked list and output the data in the nodes.

    for( itList = NodeList.begin(); itList != NodeList.end(); ++itList )
        cout << (*itList).data << endl;

    return 0;
}

---

I tested it after typing it in just as you see it above and there were no errors under MSVC++ 6.0. You could probably use #include <string> and use string objects instead of the character arrays.

STL is nice if you don't feel the need to understand what is going on under the behind the scenes.

Basically a list is a structure to hold data. The list can contain a group of nodes (sometimes called links). Each node has two separate parts. One part is the address of the next node in the list. The other part is data. Data can be anything. It can be a single int, a single char, a single string, or a complex set of data. Each node will have the same data format format however. As with other structures, like arrays, just because the structure exists, doesn't mean that there is anything stored in it. That is the list can be empty.

To add a node to the list you must first declare memory for the node. This is usually done dynamically, but it doesn't have to be. Data is then assigned to the various data members of the node either before or after adding it to the list. Use whatever assignment strategies are necessary depending on the type of the data member(s).