- 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 / Linked Lists »
In a linked list each node has the address of the next node. Insert/delete at the beginning takes only O(1) steps! A double linked list has extra previous node address. It is a perfect data structure for implementing a queue.
What is a linked list? What is the advantage of using linked lists? What is a double linked list? What can be a double linked list used for?
Click to Flip Card
