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
Each data record contains a fixed place in a relative file. Each record ought to have associated with it in integer key value which will help identify this slot. Therefore, this ke

How to construct a data flow diagram for a college assignment and marking systemA

Program: Program segment for insertion of an element into the queue add(int value) { struct queue *new; new = (struct queue*)malloc(sizeof(queue)); new->value = val

Define Prim's Algorithm Prim's  algorithm  is  a  greedy  algorithm  for  constructing  a  minimum  spanning  tree  of  a  weighted linked graph. It works by attaching to a bef

explain quick sort algorithm

Your program should include three components selling, buying and managing for the use of sellers, buyers and the Manager, respectively. Provide a menu for a user to enter each comp

Tree is dynamic data structures. Trees can expand & contract as the program executes and are implemented via pointers. A tree deallocates memory whereas an element is deleted.

We have discussed that the above Dijkstra's single source shortest-path algorithm works for graphs along with non-negative edges (like road networks). Given two scenarios can emerg

A full binary tree with n leaves have:- 2n -1 nodes.

how I can easily implement the bubble,selection,linear,binary searth algorithms?