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
Suppose there are exactly five packet switches (Figure 4) between a sending host and a receiving host connected by a virtual circuit line (shown as dotted line in figure 4). The tr

Write the non-recursive algorithm to traverse a tree in preorder.    The Non- Recursive algorithm for preorder traversal is as follows: Initially  push NULL onto stack and

Determine YIQ Colour Model Whereas an RGB monitor requires separate signals for the red, green, and blue components of an image, a television monitor uses a single composite si

merging 4 sorted files containing 50 10 25 and 15 records will take time

Explain State Space Tree If it is convenient to execute backtracking by constructing a tree of choices being made, the tree is known as a state space tree. Its root indicates a

Merging two sequence using CREW merge

Ask question #Minimum 1Mark each of the following statements as valid or invalid. If a statement is invalid, explain why. a. current ¼ list; b. temp->link->link ¼ NULL; c. trail->l

Since memory is becoming more & cheaper, the prominence of runtime complexity is enhancing. However, it is very much significant to analyses the amount of memory utilized by a prog

Define the External Path Length The External Path Length E of an extended binary tree is explained as the sum of the lengths of the paths - taken over all external nodes- from

Q. Describe the basic concept of binary search technique? Is it more efficient than the sequential search?         Ans : The bin ary search technique:- This tec