Recall the Stack ADT. It has the following operations: push(item): adds item to the top of the stack pop) : removes and returns the top item in the stack peek() : returns the top item in the stack (but does NOT remove it) size() : returns the number of items in the queue Write pseudocode for a function called remove(S, item) that takes a stack S and a value called item as input. The function removes all occurrences of item in S and returns the number of occurrences. The order of items in the modified stack must be the same as their original ordering (but with all occurrences of item absent). You can ONLY use basic control flow structures and Stack operations. You can use multiple stacks if you wish. Examples: S:= empty stack S.push('a'), S.push('t'), S.push('a'), S.push('u'), S.push('p') assert: the stack S now looks like ['a', 't', 'a', 'u', 'p'] (where 'p' is the top value) remove(S, 'a') assert: n is 2 assert : the stack S now looks like ['t', 'u', 'p'] (where 'p' is the top value) n = remove(S, 'q') assert: n is 0 and S is unchanged n =
Recall the Stack ADT. It has the following operations: push(item): adds item to the top of the stack pop) : removes and returns the top item in the stack peek() : returns the top item in the stack (but does NOT remove it) size() : returns the number of items in the queue Write pseudocode for a function called remove(S, item) that takes a stack S and a value called item as input. The function removes all occurrences of item in S and returns the number of occurrences. The order of items in the modified stack must be the same as their original ordering (but with all occurrences of item absent). You can ONLY use basic control flow structures and Stack operations. You can use multiple stacks if you wish. Examples: S:= empty stack S.push('a'), S.push('t'), S.push('a'), S.push('u'), S.push('p') assert: the stack S now looks like ['a', 't', 'a', 'u', 'p'] (where 'p' is the top value) remove(S, 'a') assert: n is 2 assert : the stack S now looks like ['t', 'u', 'p'] (where 'p' is the top value) n = remove(S, 'q') assert: n is 0 and S is unchanged n =
C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter18: Stacks And Queues
Section: Chapter Questions
Problem 1TF
Related questions
Question
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 2 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning