STACK, Data Structure & Algorithms


5. Implement a stack (write pseudo-code for STACK-EMPTY, PUSH, and POP) using a singly linked list L. The operations PUSH and POP should still take O(1) time.
Posted Date: 10/29/2012 12:17:36 PM | Location : United States







Related Discussions:- STACK, Assignment Help, Ask Question on STACK, Get Answer, Expert's Help, STACK Discussions

Write discussion on STACK
Your posts are moderated
Related Questions
W h at are the different ways by which we can represent graph?  Represent the graph drawn below using those ways.     T he d iff e r e nt w a y s by

Q. Reverse the order of the elements on a stack S    (i) by using two additional stacks (ii) by using one additional queue. Ans :      L e t S be the stac

Q. Describe the term hashing. Explain any two usually used hash functions. Explain one method of collision resolution.

* Initialise d & pi* for each vertex v within V( g ) g.d[v] := infinity  g.pi[v] := nil g.d[s] := 0; * Set S to empty * S := { 0 }  Q := V(g) * While (V-S)

Write a program to create a heap file that holds the records in the file " data_2013 " The source records are variablelength.However, the heap file should hold fixed-length reco

extra key inserted at end of array is called

Q. Draw a B-tree of order 3 for the sequence of keys written below: 2, 4, 9, 8, 7, 6, 3, 1, 5, 10

Explain the representations of graph. The different ways of representing a graph is: Adjacency list representation : This representation of graph having of an array Adj of

Hi, can you give me a quote for an E-R diagram

i need help in java recursion assignment.