Q. Perform implementation of a queue using a singly linked list L. The operations INSER and DELETE should take O (1) time.                                                                           

Ans:

Implementation of queue by using a singly linked list:

When implement a queue as a single liked list, a queue q consists of a list and two pointers, q.front and the q.rear.

inserting an element is stated below:

insert(q,x)

{

p=getnode(); info(p) = x; next(p) = null; if(q.rear == null)

q.front = p;

else

next(q.rear) = p;

q.rear = p;

}

deletion is stated below:

remove(q)

{

if(empty(q))

{

printf("queue overflow");

exit(1);

}

p=q.front; x=info(p); q.front=next(p); if(q.front == null) q.rear = null; freenode(p); return(x);

}

Posted Date: 7/10/2012 3:53:23 AM | Location : United States

Ask an Expert

Related Discussions:- Implementation of queue by using a single linked list, Assignment Help, Ask Question on Implementation of queue by using a single linked list, Get Answer, Expert's Help, Implementation of queue by using a single linked list Discussions

Write discussion on Implementation of queue by using a single linked list
Your posts are moderated

Write your message here..

Related Questions

#binary search, Ask question #Minima binary search tree is used to locate t... Ask question #Minima binary search tree is used to locate the number 43 which of the following probe sequences are possible and which are not? explainum 100 words accepted#

Recursive function, The location of a node in a binary search tree is defin... The location of a node in a binary search tree is defined as a string such as LLRRL, which represents the node that you find by starting at the root, and traversing Left, traverse

Acyclic graph, Tree is a widely used data structure employed for representi... Tree is a widely used data structure employed for representing several problems. We studied tree like a special case of acyclic graph. Though, rooted trees are most prominent of al

Cohen sutherland algorithm, Using the cohen sutherland. Algorithm. Find the... Using the cohen sutherland. Algorithm. Find the visible portion of the line P(40,80) Q(120,30) inside the window is defined as ABCD A(20,20),B(60,20),C(60,40)and D(20,40)

Dgsd, Ask question #sdgsdgsdginimum 100 words accepted# Ask question #sdgsdgsdginimum 100 words accepted#

Implement a min-heap, Description A heap is an efficient tree-based data... Description A heap is an efficient tree-based data structure that can be used as a priority queue. Recall that the abstract data type of a priority queue has the following opera

Data Mining and Neural Networks, I am looking for some help with a data min... I am looking for some help with a data mining class with questions that are about neural networks and decision trees. Can you help? I can send document with questions.

What are the example of area subdivision method, Example of Area Subdivisio... Example of Area Subdivision Method The procedure will be explained with respect to an illustrative problem, with the image consisting of five objects, namely a triangle (T), qu

First class Abstract data type , 3. A function to convert a complex number ... 3. A function to convert a complex number in algebraic form to a complex number in phasor form

Unification algorithm, i want to write code for unification algorithm with ... i want to write code for unification algorithm with for pattern matching between two expression with out representing an expression as alist