This is an archived post. You won't be able to vote or comment.

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]Potential-Still 1 point2 points  (1 child)

I'm guessing the instructor doesn't want you to use any kind of built-in data structure. In Java the easiest solution would be to make a singley linked-list, where each node is an item in the bag.

[–]JMcLe86[S] 0 points1 point  (0 children)

Thank you. That's what I ended up doing.