0
Still curious? Ask our experts.
Chat with our AI personalities
Devin
Blake
RafaAdd your answer:
Earn +20 pts
What is peep operation in stack using array in c?
I guess you mean operation top: return the topmost element without deleting it from the stack.int top (const struct stack *from, stacktype *into){if (from->elements==0) return -1; /* EMPTY */*into = from->array[from->elements -1];return 0; /* OK */}compare with pop:int pop (struct stack *from, stacktype *into){if (from->elements==0) return -1; /* EMPTY */*into = from->array[from->elements -1];--from->elements;return 0; /* OK */}
What is implicit stack?
A stack created by the user or a programmer is an implicit stack
Can stack be as a pointer?
A stack is a data structure in which last item inserted is taken out first . That's why they are known as LIFO (last in first out). Inserting an item in stack is termed as push and taking an item out from stack I s termed as pop. Stack pointer is the pointer that points to the top of the stack or that points the item at the top of the stack and help in adding or deleting the item from the top of stack.
How is the stack and stack pointer work?
A stack is a data structure in which last item inserted is taken out first . That's why they are known as LIFO (last in first out). Inserting an item in stack is termed as push and taking an item out from stack I s termed as pop. Stack pointer is the pointer that points to the top of the stack or that points the item at the top of the stack and help in adding or deleting the item from the top of stack.
In what order the elements of a pushdown stack are accessed?
Stack
