guglin.blogg.se

1. Use pseudocode to implement list stack and queues in python how to#
2. Use pseudocode to implement list stack and queues in python upgrade#

This time you definitely want to make it a private class inside DSALinkedList (see Lecture) since it must not be exposed externally apart from its Iterator interface. Java: Create a new class called DSALinkedListIterator that implements the Iterator interface. For example, we would need this for when an application's user requests to view the orders that are yet to be processed. Why iterate with a stack and a queue when you can only take from the top or front? Because there are plenty of times when you want to see what is in the stack/queue, but don't actually want to take from the stack/queue. To this end we will implement an iterator so that a client of DSALinkedList can iterate through all items in the list. ĪCTIVITY 3: ITERATOR FOR THE LINKED LIST Although we have a linked list, it's not really complete without some way of iterating over the elements. Ensure that the peeks and removeFirst() return the value of the ListNode!. removeFirst() can be tricky: again, consider all the above three cases, but note that each case must be handled explicitly (in particular, removing the node in a one- item list is a special case since it is both the first and last node). insertLast() is your next task: again, drawing diagrams can help.

Some might end up working the same, but you still need to think it through. Consider the possible cases: inserting into (i) empty list, (ii) one-item list, (ii) multi-item list.

Use pseudocode to implement list stack and queues in python how to#

Notes: When implementing insertFirst(), use linked list diagrams like those in the lectures to help you decide how to maintain tail as well as head. This makes the linked list far more efficient for queues. Redevelop the list to be doubly-linked, double-ended – that is, maintain both a head and a tail pointer as member fields. Start with a Single-ended, Singly-linked list and test it before going forward. See the Lecture Notes for how to make a private inner class of 4 Last Updated: 19/08/19 Data Structures and Algorithms. This is actually good design since it promotes information hiding (how the linked list works under the covers should not be something that clients should know about). Note that the latter will mean that you cannot return DSAListNode to any client/user of DSALinkedList. java file or place it as a private class within DSALinkedList.

Use pseudocode to implement list stack and queues in python upgrade#

YOU MUST UPGRADE IT TO BE A DOUBLY-LINKED, DOUBLE-ENDED LINKED LIST! Java: You may decide to make DSAListNode a separate. BE AWARE THAT THE LECTURE NOTE PSEUDOCODE IS FOR A SINGLE-ENDED LINKED LIST. Now let's create a linked list class: Use the pseudocode from the lectures and the book to assist you in developing DSAListNode and DSALinked List. Transcribed image text: ACTIVITY 2: LINKED LISTS IMPLEMENTATION.