I want to add a new method to the Linked Stack class to combine the current stack self with another stack other provided as an argument. You may see this as an in-place update of stack self. What would be the worst-case time complexity of this operation assuming that

self:  1 -> 2 -> 3 -> 4 -> 5   [1 is the top element]
other: 6 -> 7 -> 8 -> 9 -> 10  [6 is the top element]
The result should be:
self:  6 -> 7 -> 8 -> 9 -> 10 -> 1 -> 2 -> 3 -> 4 -> 5  [6 is the top element]

I wish to make a container class to be iterable. Which of the following statements are true?

The main operations of the Queue ADT are append() and serve(). We wish to implement the queue using linked nodes. What are the time complexities of these methods? We can assume

I have a List class and I wish to create an Iterator for it. What are the benefits of putting the Iterator in a separate class?

What is TRUE about a Python Generator?

If we were to compare the main operations of the Linked Stack and Linked Queue which one is more efficient in terms of time complexity of their operations?

I want to add a new method to the Linked Queue class to combine two queues of length

For example, if I had the following queues:

queue1: 1 -> 2 -> 3 -> 4 -> 5   [1 is the front of the queue]
queue2: 6 -> 7 -> 8 -> 9 -> 10  [6 is the front of the queue]

The resulting queue should be

queue3: 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> 7 -> 8 -> 9 -> 10 [1 is the front of the queue]

Note: queue 1 and queue 2 should maintain their original items.

If I was to loop over this Iterator, how many times would it iterate?

class NumberIterator:
    def __init__(self):
        self.current = 1
        
    def __iter__(self):
        return self
        
    def __next__(self):
        if self.current == 10:
            raise StopIteration()
        
        next_item = self.current
        self.current += 2
        return next_item

What is TRUE about a Python Generator?