## KD Tree

K-d tree is a binary search tree with more than 1 dimensions (i.e k dimensions).

K-d tree is a binary search tree with more than 1 dimensions (i.e k dimensions).

Knapsack Problem: Given total capacity [totalCapacity] of a bag,

Given a target T and a set of points S, find the nearest neighbour of T in S.

https://algs4.cs.princeton.edu/92search/QuadTree.java.html