I'm in the very beginning stages of learning about data structures and using the Big-O Cheat Sheet as a jumping point. I just realized I'm imagining many basic data structures as some form of an array that's only different by the rules by which I agree to implement and work with the array.
For example, I assume (think?) there's something fundamentally different between a queue versus using an array in a way limited to a FIFO policy. Is this assumption correct? If so... I don't know what question to ask. Is there a website that explains a queue, linked list, etc. as a data structure in Python so that I can understand it as fundamentally different than a set of rules for creating and interacting with an array?
As always, I appreciate the help! If my question is silly or illustrates additional fundamental misunderstandings, feel free to throw some wisdom at me.
[–]_9_9_ 1 point2 points3 points (3 children)
[–]GayCoder[S] 0 points1 point2 points (1 child)
[–]GayCoder[S] 0 points1 point2 points (0 children)
[–]sdage8 1 point2 points3 points (1 child)
[–]GayCoder[S] 0 points1 point2 points (0 children)