Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

Programming Project 2 (Page 191) [Book: Data Structures 2E/ Abstraction and Desi

ID: 3794098 • Letter: P

Question

Programming Project 2 (Page 191) [Book: Data Structures 2E/ Abstraction and Design Using Java] Based on the material on pages 167-169. Include the ability to reinitialize the stack to empty and test for empty and full stack. Note that there are four applications in this chapter: Palindrome, Infix to Postfix, Parentheses Checker, Postfix Evaluator.
Do a complete solution that includes a Unit test with the test data. Also, allow for presenting a different test data set, explanining how to feed it into your class.
Programming Project 2: Provide a complete implementation of class LinkedStack intestate on each of the applications in this chapter.

Explanation / Answer

// we assume that first is a reference to the first Node in the list public void delete(int k) { if (k