Programming Throwdown cover image

Trees

Programming Throwdown

00:00

How to Find the Nearest Neighbor on Multi Dimensional Trees

When we talk about multi dimensional, it's having at least two or more uh dimensions. So both k d s and things now i'm going to talk about, and some others, try to divy up the space in a way that moves back and forth between the dimensions. And you're sort of intermixing the the two dimensions um and trying to sort of inner leaves so that you can get to your answer a little bit faster.

Transcript
Play full episode

The AI-powered Podcast Player

Save insights by tapping your headphones, chat with episodes, discover the best highlights - and more!
App store bannerPlay store banner
Get the app