This preview shows page 1. Sign up to view the full content.
Unformatted text preview: access structure. d. A queue is a lastin, firstout structure, and a stack is a firstin, firstout structure. e. A queue is a firstin, firstout structure, and a stack is a randomaccess structure. 20. Write the algorithm for Push in an arraybased implementation. 21. Write the algorithm for Pop in an arraybased implementation. 22. Write the algorithm for Enque in an arraybased implementation. 23. Write the algorithms for Deque in an arraybased implementation. 24. Write the algorithm for Push in a linked implementation. 25. Write the algorithm for Pop in a linked implementation. 26. Write the algorithm for Enque in a linked implementation. 27. Write the algorithms for Deque in a linked implementation. 10 length [0] list [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] 5 7 20 33 44 46 48 99 101 102 105...
View
Full
Document
 Fall '10
 MARIANAKANT

Click to edit the document details