Question

1 Data Structures
Q1
Consider a stack, S: 3,2,1,_,_,_. The value of x equals 0.
The following operation is being performed:
TOP = TOP + 1
STACK[TOP] = x
How many elements are present in the stack after the operation has been performed?
Ops: A.
04
131
B.
1
C.
02
h
D.
03
Q.2
Fill in the blank:
Helen wants to insert an element in a priority queue. The time complexity to carry out th​

Answer 1

Answer:

uiz 4 Solutions

Stacks are first-in, first-out (FIFO) data structures. c. New nodes can only be added to the top of the stack. d. The last node (at the bottom) of ...

5 pages·516 KB