A KD-Tree (K-Dimensional Tree) #844
Conversation
Codecov ReportAttention: Patch coverage is
Additional details and impacted files@@ Coverage Diff @@
## master #844 +/- ##
==========================================
+ Coverage 95.42% 95.43% +0.01%
==========================================
Files 316 317 +1
Lines 22754 23095 +341
==========================================
+ Hits 21713 22041 +328
- Misses 1041 1054 +13 ☔ View full report in Codecov by Sentry. |
|
This pull request has been automatically marked as abandoned because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions. |
|
This pull request has been automatically marked as abandoned because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions. |
|
Please ping one of the maintainers once you commit the changes requested or make improvements on the code. If this is not the case and you need some help, feel free to ask for help in our Gitter channel. Thank you for your contributions! |
2 participants
A K-D Tree (also known as a K-Dimensional Tree) is a binary search tree where each node contains a K-Dimensional point in space. Essentially, it is a space-partitioning data structure used to organize points in a K-Dimensional space, which facilitates the search for nearest neighbors.
In addition to the basic operations of insertion, search, and deletion, this implementation also supports nearest neighbor searches and median finding to maintain balance during insertions. Furthermore, it includes a merge method that allows the combination of two K-D Trees by gathering their points and constructing a balanced K-D Tree from them.
Read more:
https://www.geeksforgeeks.org/search-and-insertion-in-k-dimensional-tree/
https://www.geeksforgeeks.org/deletion-in-k-dimensional-tree/