Question: ASAP HW4: 1) Implement MyArrayStack (constructor, push, pop, peek and isEmpty), and MyLinkedQueue with both next and previous pointers (constructor enqueuer/offer, dequeuer/poll, peek and isEmpty),
HW4: 1) Implement MyArrayStack (constructor, push, pop, peek and isEmpty), and MyLinkedQueue with both next and previous pointers (constructor enqueuer/offer, dequeuer/poll, peek and isEmpty), and write the following two program to test them. (10 points) 2) For stack testing, write a program to check if a string has matching parenthesis such as "(O)", but not "(. (5 points) 3) For stack testing, use it to "Evaluating Expressions" using the algorithm given below. (5 points
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
