You must Sign In to post a response.

Discuss: How linked list is accessed?

This thread is to discuss the opinion poll topic 'How linked list is accessed?'.
in C++ there are main two type of linked list
1) singly linked list
2) doubly linked list

in singly linked list there are one pointer to the next node that have the memory address of the next node

in doubly linked list there are two pointer one is to previous node and one is to the next node


#571400    Author: Manisha  02 Dec 2010 Member Level: Silver   Points : 2

There are three type of linked list available in c++
1) singly linked list - one pointer at the beginning of list
2) doubly linked list - two pointers one at beginning and other at the ending point.
3) circular linked list - two pointers front and rear and rear pointer again points first node of list.

we can access data in a particular sequence in any linked list

#571651    Author: jigar    03 Dec 2010 Member Level: Silver   Points : 1

Actually in circular linked list both singly and doubly linked list are there

This thread is locked for new responses. Please post your comments and questions as a separate thread.
If required, refer to the URL of this page in your new post.