- Algorithms
- Recursion
- Call Stack
- Iterative Approach
- Memoization
- Head Tail
- Data Structures
- Arrays, Sets
- Time Complexity
- Hash Tables
- Stacks
- Queues ♣
- Linked Lists
- Binary Search Trees
- Tries
- Graphs
- Divide Conquer
- Binary Search
- Quicksort
- Merge Sort
- Karatsuba Multiplication
- Graph Traversal
- Flood Fill
- Depth First Search
- Breadth First Search
- Dijkstra's Algorithm
- Decision Making
- Minimax
Algorithms
Machine Learning
Data Structures / Queues »
Like stacks, queues is are lists with constrains. Insert at the end, read/delete only from the front. Queue's operations are described with FIFO acronym. A queue is like a line of people at the movie theater. In Python the data type for stacks is called deque.
What is a queue? What are the constrains when working with queues? What's the acronym for queue's operations? How can you discribe a queue? What's the Python built-in data type for queues?
Click to Flip Card
