how to create a doubly liked list???

[surrealtrauma]

I want to ask what's the differences between doubly liked list and linear
liked list, and also the circular doubly liked list in terms of
implementation. THX

[Ivan Vecerina]

"surrealtrauma" <su***********@hotmail.com> wrote in message
news:7b******************************@localhost.ta lkaboutprogramming.com...

I want to ask what's the differences between doubly liked list and linear
liked list, and also the circular doubly liked list in terms of
implementation. THX

In C++ you create a doubly linked list by using std::list
in the standard library.
Other than that, your question is not about C++, and does
not belong in this newsgroup (try comp.programming).

This said:
In a doubly linked list, each list entry stores a pointer
to both the next and the previous item. A single-linked
list only stores a pointer to the next item.

"Linear" linked list doesn't mean much too me, except
when opposed to more general graph structures (e.g. trees).

A circular linked list is a list where the 'next' pointer
of the last item points to the first item (and reciproqually
for the 'prev' pointer of the first item).
hth-Ivan
--
http://ivan.vecerina.com/contact/?subject=NG_POST <- email contact form

[sam]

Ivan Vecerina wrote:

"surrealtrauma" <su***********@hotmail.com> wrote in message
news:7b******************************@localhost.ta lkaboutprogramming.com...

I want to ask what's the differences between doubly liked list and linear
liked list, and also the circular doubly liked list in terms of
implementation. THX
In C++ you create a doubly linked list by using std::list
in the standard library.
Other than that, your question is not about C++, and does
not belong in this newsgroup (try comp.programming).

This said:
In a doubly linked list, each list entry stores a pointer
to both the next and the previous item. A single-linked
list only stores a pointer to the next item.

"Linear" linked list doesn't mean much too me, except
when opposed to more general graph structures (e.g. trees).

A circular linked list is a list where the 'next' pointer
of the last item points to the first item (and reciproqually
for the 'prev' pointer of the first item).

This is a general C programming practice.
hth-Ivan

[osmium]

"surrealtrauma" writes:

I want to ask what's the differences between doubly liked list and linear
liked list, and also the circular doubly liked list in terms of
implementation. THX

This link should be helpful.

http://en.wikipedia.org/wiki/Linked_list