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
explanation of doubly linklist

differentiate between indexing and hashing in file organization

The above 3 cases are also considered conversely while the parent of Z is to the right of its own parent. All the different kind of cases can be illustrated through an instance. Le

Explain Internal and External Nodes  To  draw  the  tree's  extension  by  changing  the  empty  subtrees  by  special nodes. The  extra  nodes shown by little squares are know

In this project you will write a program to produce a discrete time simulation of a queue as shown in Fig. 1. Time is slotted on the input and the output. Each input packet follows

What is Ruby Ruby has numerous simple types, including numeric classes such as Integer, Fixnum, Bignum, Float, Big Decimal, Rational, and Complex, textual classes like String,

example of stack using flowchart

Let us assume a sparse matrix from storage view point. Assume that the entire sparse matrix is stored. Then, a significant amount of memory that stores the matrix consists of zeroe

A tree is a non-empty set one component of which is designated the root of the tree while the remaining components are partitioned into non-empty groups each of which is a subtree