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
Example which cause problems for some hidden-surface algorithms Some special cases, which cause problems for some hidden-surface algorithms, are penetrating faces and cyclic ov

A significant aspect of Abstract Data Types is that they explain the properties of a data structure without specifying the details of its implementation. The properties might be im

Q. Which sorting algorithm can be easily adaptable for singly linked lists? Explain your answer as well.        Ans: The simple Insertion sort is sim

Define Merge Sort  Merge sort is a perfect example of a successful application of the divide and conquer method. It sorts a given array A[0...n-l] by separating it into two ha

Write an algorithm for binary search. What are its limitations? .

Game trees An interesting application of trees is the playing of games such as tie-tac-toe, chess, nim, kalam, chess, go etc. We can picture the sequence of possible moves by m

Operation of Algorithm The following sequence of diagrams shows the operation of Dijkstra's Algorithm. The bold vertices show the vertex to which shortest path has been find ou

Q. Convert the given infix expression into the postfix expression (also Show the steps) A ∗ (B + D)/ E - F(G + H / k ) Ans. Steps showing Infix to Post fix


Merge sort: Merge sort is a sorting algorithm that uses the idea of split and conquers. This algorithm splits the array into two halves, sorts them separately and then merges t