A single array A [1........MAXSIZE] is used to implement two stacks. The two stacks grow from opposite ends of the array. Variables top 1 and top 2 (top 1<top 2) point to the location of the topmost element in each of the stacks. If the space is to be used efficiently, the condition for “stack full” is

Keep practicing — related questions

• _______________ specifies the overflow condition in stack.
• If Top = MAX - 1, then what would be the state of the stack?
• What is the mean of 'MAX' term in the syntax below? typedef struct stack{ int data[MAX]; int top;}stack;
• _____________ has fixed upper-bound size that has to be specified while it is declared.
• How will you find out the maximum number of elements present in a stack?
• In an empty stack, perform the following operations: push (A), push (B), push (C), pop, pop, push (D), push...
• Which of the following statements regarding the stack data structure is false?
• An implementation of a queue Q, using two stacks S1 and S2, is given below: void insert (Q, x) { push (S1, ...