KD-tree C# implementation in Grasshopper

I plan to give a brief intro about the fast searching algorithm, named K-dimensional Tree and implement once by making a .gha components written in C#.

My github repo for this topic:
https://github.com/ChenChihYuan/KD_Tree_Intro

It will be great if all the participants can install the following things beforehead.

1. Visual Studio
2. Grasshopper Component Template for on Visual Studio <- People can follow the guide here(https://developer.rhino3d.com/guides/grasshopper/your-first-component-windows/)
3. [optional] Lunchbox -> compare with their RTree Component/ RTree Closest Point Component
4. [optional] Metahopper -> I will use Bottleneck Navigatior function to show the benchmark for each method.

This workshop will be held in English mainly and with slightly Japanese, also Chinese(maybe).

Also, I will give some comparison with other well known algorithm/data structure for fast searching in space. Still I have a lot things I didn’t know, so might have misunderstood some part. And I am glad if anyone can point out to help, thanks.

※There's also the possibility of live coverage on Youtube Live.
※We will be recording this zoom meeting and sharing it with the participants for their learning.