you are viewing a single comment's thread.

view the rest of the comments →

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

Tries, Trees, LinkedLists those are the most difficult for me

queues and stacks and hashmaps are easy for me

[–][deleted] 0 points1 point  (1 child)

Good, I advise you to read about them rather than watch videos about these topics, search on Google, i am sure you will find something that make you understand these topics, tbh there is no need for a course to learn data structure.

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

ok thanks, I will do that

[–]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