YouTipArrays and Linked Lists
// Array - O(1) access, O(n) insert
let arr = [1, 2, 3];
arr.push(4);
// Linked List - O(n) access, O(1) insert
class Node {
constructor(val) { this.val = val; this.next = null; }
}Stack and Queue
// Stack (LIFO)
let stack = [];
stack.push(1); stack.pop();
// Queue (FIFO)
let queue = [];
queue.push(1); queue.shift();Summary
- Arrays have fast random access
- Stacks are LIFO, queues are FIFO