Method insert

code/data-structures/kd_tree.test.cpp:40–42

  }

  void insert(const point &p) {
    pts.insert(p);
  }

  pair<point, bool> nearest_neighbour(const point &p, bool allow_same = true) {
    double mn = INFINITY;