k-d tree (A k-dimensional tree)

[bomenderick]

Description

A K-D Tree(also known as a K-Dimensional Tree) is a binary search tree where data in each node is a K-Dimensional point in space. In short, it is a space partitioning data structure for organizing points in a K-Dimensional space in other to facilitate nearest neighbor search of points. In addition to insert, search, and delete methods, the implementation also supports nearest neighbors search, median finding for insertion in other to keep the k-d tree balanced, and a merge method to combine two k-d trees by collecting their points and building a balanced k-d tree from it.

Read more:

• https://www.geeksforgeeks.org/search-and-insertion-in-k-dimensional-tree/
• https://www.geeksforgeeks.org/deletion-in-k-dimensional-tree/

[codecov-commenter]

Codecov Report

Attention: Patch coverage is 83.87097% with 55 lines in your changes missing coverage. Please review.

Project coverage is 95.14%. Comparing base (be27f2c) to head (8f06c40). Report is 6 commits behind head on master.

Files with missing lines	Patch %	Lines
src/data_structures/kd_tree.rs	83.87%	55 Missing :warning:

Additional details and impacted files

```diff @@ Coverage Diff @@ ## master #805 +/- ## ========================================== - Coverage 95.32% 95.14% -0.18% ========================================== Files 310 311 +1 Lines 22488 22771 +283 ========================================== + Hits 21437 21666 +229 - Misses 1051 1105 +54 ```

:umbrella: View full report in Codecov by Sentry.
:loudspeaker: Have feedback on the report? Share it here.

[github-actions[bot]]

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.

[github-actions[bot]]

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!