Delete a given specific node from a doubly linked list. , Data Structure & Algorithms

 

Delete a specific Node from Double Linked List as follows

DELETEDBL(INFO, FORW, BACK, START, AVAIL,LOC)

1. [Delete Node]

Set FORW [ BACK [LOC]]:= FORW[LOC]& BACK [FORW[LOC]]:=BACK[LOC].

2. [Return node to AVAJL list]

Set FORW[LOC]:=AVAIL & AVAIL:=LOC

3. Exit.

 

 

Posted Date: 7/13/2012 2:13:08 AM | Location : United States







Related Discussions:- Delete a given specific node from a doubly linked list. , Assignment Help, Ask Question on Delete a given specific node from a doubly linked list. , Get Answer, Expert's Help, Delete a given specific node from a doubly linked list. Discussions

Write discussion on Delete a given specific node from a doubly linked list.
Your posts are moderated
Related Questions
It is a useful tool for indicating the logical properties of data type. It is a collection of values & a set of operations on those values. Methodically, "a TYPE is a set, & elemen

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

State about the Bit String Carrier set of the Bit String ADT is the set of all finite sequences of bits, including empty strings of bits, which we denote λ. This set is {λ, 0

What do you understand by structured programming Structured Programming  This term is used for programming design that emphasizes:- (1) Hierarchical design of programmi

Pre-order Traversal The method of doing a pre-order traversal iteratively then has the several steps(suppose that a stack is available to hold pointers to the appropriate nodes

Gouraud Shading The faceted appearance of a Lambert shaded model is due to each polygon having only a single colour. To avoid this effect, it is necessary to vary the colour ac

Graph Traversal In many problems we wish to investigate all the vertices in a graph in some systematic order. In graph we often do not have any single vertex singled out as spe

Ordinary variable An ordinary variable of a easy data type can store a one element only

Q. How can we free the memory by using Boundary tag method in the context of Dynamic memory management?

Question 1 Write a program in 'C' to read N numbers and print them in descending order Question 2 Discuss the properties of ADT Question 3 Write a note on