linked_list_stack_shopping_list_manager.py This is a file that includes the class of linked list based shopping list manager. This class contains such methods as init, insert_item, is_list_empty, print_item_recursive_from_top, print_items_from_top, print_item_recursive_from_bottom, print_items_from_bottom, getLastItem, removeLastItem. In addition, this class requires the inner class to hold onto data as a linked list based on Stack. DO NOT use standard python library, such as deque from the collections module. Please keep in mind the following notes for each method during implementation: Init(): initializes linked list based on Stack object to be used throughout object life. insert_item(item): inserts item at the front of the linked list based on Stack. Parameters: item name. is_list_empty (): checks if the current Stack object is empty (ex. check if head is None). print_item_recursive_from_top(currentNode): a helper method to print linked list based on Stack item recursively. Note: try to print as [ itemTop itemTop-1 item… ] from the top of the Stack by using some combinations of “print(item, end = " ")”. Parameters: current visiting node. print_items_from_top(): calls print_item_recursive_from_top method with current Stack object. print_item_recursive_from_bottom(currentNode): a helper method to print linked list based Stack item recursively. Note: try to print as [ itemBottom itemBottom+1 item… ] from the bottom of the Stack by using some combinations of “print(item, end = " ")”. Parameters: current visiting node. Hint: try to rearrange when you use the print method. print_items_from_bottom(): calls print_item_recursive_from_bottom method with current Stack object. getLastItem(): returns last inserted item data. This method operates similarly to the Stack Peek operation. removeLastItem(): returns the last inserted item while removing it. This method operates similar as Stack Pop operation.
linked_list_stack_shopping_list_manager.py This is a file that includes the class of linked list based shopping list manager. This class contains such methods as init, insert_item, is_list_empty, print_item_recursive_from_top, print_items_from_top, print_item_recursive_from_bottom, print_items_from_bottom, getLastItem, removeLastItem. In addition, this class requires the inner class to hold onto data as a linked list based on Stack. DO NOT use standard python library, such as deque from the collections module. Please keep in mind the following notes for each method during implementation: Init(): initializes linked list based on Stack object to be used throughout object life. insert_item(item): inserts item at the front of the linked list based on Stack. Parameters: item name. is_list_empty (): checks if the current Stack object is empty (ex. check if head is None). print_item_recursive_from_top(currentNode): a helper method to print linked list based on Stack item recursively. Note: try to print as [ itemTop itemTop-1 item… ] from the top of the Stack by using some combinations of “print(item, end = " ")”. Parameters: current visiting node. print_items_from_top(): calls print_item_recursive_from_top method with current Stack object. print_item_recursive_from_bottom(currentNode): a helper method to print linked list based Stack item recursively. Note: try to print as [ itemBottom itemBottom+1 item… ] from the bottom of the Stack by using some combinations of “print(item, end = " ")”. Parameters: current visiting node. Hint: try to rearrange when you use the print method. print_items_from_bottom(): calls print_item_recursive_from_bottom method with current Stack object. getLastItem(): returns last inserted item data. This method operates similarly to the Stack Peek operation. removeLastItem(): returns the last inserted item while removing it. This method operates similar as Stack Pop operation.
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 3 images
