# 4.9. Discussion Questions¶

Convert the following values to binary using “divide by 2.” Show the stack of remainders.

17

45

96

The alternative implementation of the

`Queue`

ADT is to use a list such that the rear of the queue is at the end of the list. What would this mean for Big-O performance?What is the result of carrying out both steps of the linked list

`add`

method in reverse order? What kind of reference results? What types of problems may result?Explain how the linked list

`remove`

method works when the item to be removed is in the last node.Explain how the

`remove`

method works when the item is in the*only*node in the linked list.

You have attempted of activities on this page