EPISODE · Feb 5, 2016 · 14 MIN
[MINI] k-d trees
from Data Skeptic
This episode reviews the concept of k-d trees: an efficient data structure for holding multidimensional objects. Kyle gives Linhda a dictionary and asks her to look up words as a way of introducing the concept of binary search. We actually spend most of the episode talking about binary search before getting into k-d trees, but this is a necessary prerequisite.
NOW PLAYING
[MINI] k-d trees
No transcript for this episode yet
Similar Episodes
May 11, 2026 ·66m
May 11, 2026 ·67m
May 5, 2026 ·4m
May 4, 2026 ·4m