请有人帮我解释一下链表吗？

Question

我已经花了很多时间来学习链表，但是我的所有工作都浪费了，请提供一个自己的代码可以帮助我理解链表吗？

Answer 1

A linked list is simply a list of elements (usually called nodes) where each node has a reference (or pointers, in C) to the next node:

http://img837.imageshack.us/img837/5613/ll1s.png

You keep track of the list by having a pointer to the first node (the "head"), and by having the last node point to null

Linked lists where each element points to both the next and previous nodes are called doubly-linked lists.

By following these references, you can traverse the list and get any node.

A common advantage of linked lists over arrays is that you can insert and remove the elements in O(1) (constant) time. The disadvantage is that you have O(N) random-access.

See Wikipedia for more.

Answer 2

Have you play some of these rally games? The organizer left this hints all around the city and you must get one hint and then solve the riddle for getting the position of the next hint. Now, imagine every hint comes with a little prize.

Well, linked list are like that: every element has "content" on it AND the memory address (the hint) for getting the next item. The next item, of course, has another prize and another hint.

Answer 3

A linked list is a series of object each pointing to the next one in the list. The last element in the list has NULL as it's next pointer.

You keep track of the head of the list in your program so you can traverse the list from the start.

You might want to keep track of the current position in the list, but that will depend on your application.

A doubly linked list has a previous element pointer too enabling you to traverse the list in both directions.

This:

typedef struct tagProp
{
   rtPropertyKey   key;
   rtProperty      property;
   struct tagProp *next;
} TProperty;

defines a property key/value lookup list.

Answer 4

A linked list is implemented as a list of "nodes". The nodes are linked together using pointers. The following code describes one node. The pointer to the next node is called next. In my example, each node contains an integer value as its data.

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

The fun is how to actually create a list. You have to use malloc to create new nodes. When you malloc the new node, you have to tie into the list using the next pointer.

We can help you more if you specifically tell us what your issues are...