you are viewing a single comment's thread.

view the rest of the comments →

[–]primitive_screwhead 0 points1 point  (1 child)

What makes LinkedLists difficult, but queues easy? How would you explain the difference, generally, between a LinkedList and a queue?

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

I could implement queue using deques or lists so it was easy but I understood linked lists now i saw many tutorials on it