Double linked list, Data Structure & Algorithms

In a doubly linked list, also called as 2 way list, each node is divided into 3 parts.

The first part is called previous pointer field. It contains the address of the preceding elements in the list. The second part contains the information of the element and the third part is called next pointer field. It contains the address of the succeeding elements in the list. In addition 2 pointer variable HEAD and TAIL are used that contains the address of the 1st element or the address of the last element of the list. Doubly linked list can be traversed in both directions.

628_double link list.png

Posted Date: 7/12/2012 9:20:50 AM | Location : United States







Related Discussions:- Double linked list, Assignment Help, Ask Question on Double linked list, Get Answer, Expert's Help, Double linked list Discussions

Write discussion on Double linked list
Your posts are moderated
Related Questions
A database is a collection of data organized in a manner that facilitates updation, retrieval and management of the data. Searching an unindexed database having n keys will have a

Ask question find frequency count of function- {for(i=1;i {for(j=1;j {for(k=1;k } } }

Explain Optimal Binary Search Trees One of the principal application of Binary Search Tree is to execute the operation of searching. If probabilities of searching for elements

Explain class P problems Class  P  is  a  class  of  decision  problems  that  can  be  solved  in  polynomial time  by(deterministic) algorithms. This class of problems is kno

Develop a program that accepts the car registration( hint: LEA 43242010)

what is tree

Initially Nodes are inserted in an AVL tree in the same manner as an ordinary binary search tree. Though, the insertion algorithm for any AVL tree travels back along with the pa

In a chained hash table, each table entry is a pointer to a collection of elements. It can be any collection that supports insert, remove, and find, but is commonly a linked list.

write a c++ program to find out the area of a curve y=f(x) between x=a and x=b

what is far and near procedures in system programming?