Multidimensional Data, Video 7 K d Tree Nearest Finding

[@vellyxenya3970]

Thank you, your video is the first one I found that truly explains how to find deterministicly find the nearest neighbour, and not just probabilisticly.

[@erik....]

Thanks, best k-d tree video I've found so far.

[@ayoubrayanemesbah8845]

you are the best , you have explained the algorithm as simple as possible ,one day inshaa lallah i'll be able to expalined as good as you

[@Jeremylinnn]

Thank you Josh! That's a very clear and detailed explanation :)

[@klausdupont6335]

Very clear explanation especially on pruning the unpromising spaces! Thanks!

[@MONST3R68]

Hi Josh, I think we should check the RIGHT SIDE of C ... what if C and E are really close?

[@karlrombauts4909]

This is such a clear explanation! Thank you very much :)

[@theendurance]

such an intuitive explanation to a complex data structure. thanks

[@deeppant2866]

That was really good. Even made fun following the video

[@smallsdoor]

Great video, thank you, Josh

[@weiranfu4831]

Thanks Josh!

[@gigabytechanz9646]

Very interesting!

[@patrice9197]

Hello Josh! I'm trying to figure out now for over 20h how I could implement the down-up step recursively. Doing the up-down is kinda easy but when I wanna walk up and check the other nodes recursively, I always end in an endless recursion loop. Could you provide me a pseudo code for the down-up step? That would totally make my day! :)

[@scm534]

12:33 Hi Josh.. what are you trying to say here? very confused.

[@ChathuraJayalath]

Thank you good sir.

[@gustavlj]

thx