MCPcopy Create free account
hub / github.com/SuprDewd/CompetitiveProgramming / node

Class node

code/data-structures/kd_tree.cpp:38–41  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

36 else nf.coord[c] = max(nf.coord[c], l);
37 return bb(nf, nt); } };
38 struct node {
39 pt p; node *l, *r;
40 node(pt _p, node *_l, node *_r)
41 : p(_p), l(_l), r(_r) { } };
42 node *root;
43 // kd_tree() : root(NULL) { }
44 kd_tree(vector<pt> pts) {

Callers

nothing calls this directly

Calls

no outgoing calls

Tested by

no test coverage detected