From Zero To Binary Search Tree
summary
Builds working JavaScript versions of lists, stacks, queues, hash tables and binary search trees and shows the code doing insert, access and delete so performance claims are verifiable. Uses plain arrays to simulate memory, demonstrates push/pop O(1) and shift/unshift O(n), implements a simple hash function but glosses over hashing without collision handling, and shows a BST lookup that takes ~10 checks for 1,000 items. Code is educational not production hardened.
AI-written summary · about
chapters (14)
- 0:00Introduction
- 4:45Big Os
- 9:57Data Structures
- 10:28List
- 12:13Shift
- 13:49Hash Tables
- 16:49Organization
- 17:27Stack
- 18:46Queue
- 20:09Graphs
- 22:28Linked Lists
- 25:11Trees
- 25:39Tree Structure
- 27:12Binary Search Tree
related talks
27mFrom Zero to Binary Search Tree
45mYou need to know Algorithms and Data Structures in Front-end anyway
24mEssential Big O for JavaScript Developers
53mAlgorithms Demystified
43mJavaScript ❤ binary data
33mImmutable data structures for functional JS
45mYou need to know Algorithms and Data Structures in Front-end, anyway
05mBinary in JavaScript