![[MINI] k-d trees](https://static.libsyn.com/p/assets/d/f/3/6/df360841c3db6c82/k-d-trees.png)
[MINI] k-d trees
Podcast: Data SkepticPublished On: Fri Feb 05 2016
Description: 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.
The note was deleted
The note was saved
Your message was sent