From charlesreid1

(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...")
 
No edit summary
Line 1: Line 1:
==Stacks and Queues - why==
Why stacks and queues? If you follow the abstract data type interface, all operations to access stacks and queues are O(1).
Why stacks and queues? If you follow the abstract data type interface, all operations to access stacks and queues are O(1).


Line 6: Line 8:


[[StacksQueues/Python]]
[[StacksQueues/Python]]
==Flags==
{{CSFlag}}

Revision as of 06:12, 30 May 2017

Stacks and Queues - why

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


Flags





See also: