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
an electrical student designed a circuit in which the impedence in one part of a series circuit is 2+j8 ohms and the impedent is another part of the circuit is 4-j60 ohm mm program

Program: Creation of a linked list In the next example, wewill look to the process of addition of new nodes to the list with the function create_list(). #include #includ

Ask question #Minimum 10000 words accepted#

Write an assembly program to separate the number of positive numbers and negative numbers from a given series of signed numbers.

1) What will call a graph that have no cycle? 2) Adjacency matrix of an undirected graph is------------- on main diagonal. 3) Represent the following graphs by adjacency matr

The following are several operations on a AA-tree: 1. Searching: Searching is done using an algorithm which is similar to the search algorithm of a binary search tree. 2. Ins

Define the Internal Path Length The Internal Path Length I of an extended binary tree is explained as the sum of the lengths of the paths taken over all internal nodes- from th

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

data structure for multiqueue

The data structure needed to evaluate a postfix expression is  Stack