From charlesreid1

Revision as of 05:32, 30 May 2017 by Admin (talk | contribs) (Created page with "Why stacks and queues? If you follow the abstract data type interface, all operations to access stacks and queues are O(1). Stacks - last-in, first-out data structure where t...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Why stacks and queues? If you follow the abstract data type interface, all operations to access stacks and queues are O(1).

Stacks - last-in, first-out data structure where things are added and removed from the top.

Queues - first-in, first-out data structure where things are removed from the front and added to the back.

StacksQueues/Python