Currently I'm working on a K-D (K dimensional) Tree implementation in C sharp.
I first tried to make a Binary Search Tree and that went very well. Altough I'm struggling by making the KD Tree, it seems very complicated to me.
I'm looking for some reccomandations and good practices regarding K-D tree's. For my particular exercise I'm trying to implement a 2D tree (X,Y).
If people are interested I can show some of the BST code
by Snavelzalf via /r/csharp