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
Find a minimum cost spanning arborescence rooted at r for the digraph shown below, using the final algorithm shown in class. Please show your work, and also give a final diagram wh

Five popular hashing functions are as follows: 1) Division Method 2) Midsquare Method 3) Folding Method 4) Multiplicative method 5) Digit Analysis

In this unit, we discussed Binary Search Trees, AVL trees and B-trees. The outstanding feature of Binary Search Trees is that all of the elements of the left subtree of the root

Illustrates the program segment for Quick sort. It uses recursion. Program 1: Quick Sort Quicksort(A,m,n) int A[ ],m,n { int i, j, k; if m { i=m; j=n+1; k

Q. Write down an algorithm to evaluate an expression given to you in postfix notation. Show the execution of your algorithm for the following given expression. AB^CD-EF/GH+/+*

Ask queConsider the following functional dependencies: Applicant_ID -> Applicant_Name Applicant_ID -> Applicant_Address Position_ID -> Positoin_Title Position_ID -> Date_Position_O

The insertion procedure in a red-black tree is similar to a binary search tree i.e., the insertion proceeds in a similar manner but after insertion of nodes x into the tree T, we c

If a Dequeue is implemented via arrays, then this will suffer with the similar problems which a linear queue had suffered. Program 8 gives the array implementation of Dequeue.

You will write functions for both addition and subtraction of two numbers encoded in your data structure. These functions should not be hard to write. Remember how you add and subt

Define Dynamic Programming  Dynamic  programming  is  a  method  for  solving  problems  with  overlapping  problems.  Typically, these sub problems arise from a recurrence rel