Add KdTree

Author: ocramz

_posts/2016-10-19-current-environment.md

@@ -52,6 +52,7 @@ The type classes defined in `Algebra.Graph.Class` and `Algebra.Graph.HigherKinde
 ### Trees
 
   - **tree-traversals** [![Hackage](https://img.shields.io/hackage/v/tree-traversals.svg)](https://hackage.haskell.org/package/tree-traversals) [![tree-traversals](http://stackage.org/package/tree-traversals/badge/lts-11)](http://stackage.org/lts-11/package/tree-traversals) [![tree-traversals](http://stackage.org/package/tree-traversals/badge/nightly)](http://stackage.org/nightly/package/tree-traversals) : The tree-traversals package defines in-order, pre-order, post-order, level-order, and reversed level-order traversals for tree-like types, and it also provides newtype wrappers for the various traversals so they may be used with `traverse`.
+  - **KdTree**  [](https://github.com/binarysunrise-io/kdtree){:.github} [![Hackage](https://img.shields.io/hackage/v/KdTrees.svg)](https://hackage.haskell.org/package/KdTrees) [![KdTrees](http://stackage.org/package/KdTrees/badge/lts-11)](http://stackage.org/lts-11/package/KdTrees) [![KdTrees](http://stackage.org/package/KdTrees/badge/nightly)](http://stackage.org/nightly/package/KdTrees) : A simple library for k-d trees in Haskell. It enables searching through collections of points in O(log N) average time, using the nearestNeighbor function.
 
 
 ## Database interfaces