Lab46 Wiki

Stacks are linear data structures, that may be structured by linked lists. Linked lists are only accessed by one end and in the case of our project, this may be the lead or last node, (we will have to verify that with the unit tests scripts).

There will be approximately 7 functions, will have to confirm that once you upgrade. These new functions go as follows:

• push() - Place a new node onto top of stack.
• pop() - Remove a node from top of stack.
• peek() - See node from top of stack.
• isempty() - Return if stack is empty or not.
• cpstack() - Copy stack to another.
• mkstack() - Create and initialize a new stack.
• rmstack() - Empty, deallocate, and nullify stack.

*Our task is to ask questions on Discord or in class and document our findings on this wiki page collaboratively, regarding the functionality of this project.

*For anybody interested in editing the wiki page, here is the dokuwiki user guide: https://www.dokuwiki.org/wiki:syntax#basic_text_formatting -Ash

Inside the stack are 3 different objects, a node, a list, and the size of the stack. The node is the top of the stack, and follows the last node of the list. For the purpose of your push and pop functions, new nodes from push should go to the end of the list, and that should be the new top. For pop, it should take off the end of the list, and reassign the new top, which is the last node in the list.