#pragma once

#define COVER_BASE 1.3

#include <stdlib.h>
#include <iostream>
#include <vector>
#include <math.h>

#include "point.h"

using namespace std;

struct node
{
	point pt;
	vector<node*> children;
	int count;
	int below;
	int level;
};

bool c_insert(point p, node *parent, node *head);
void cover_set(vector <point> &set, int lev, node *head);
void add_points(vector <point> &set, node *n, int level);
float set_dist(point p, const vector <point> &set);
float set_dist(point p, const vector <node> &set);
void print_tree(node *head, int lev);
void k_nn(point p, int k, node *head, vector <point> &results);