K D Tree Code designed for an Uber interview. It uses a heap array for space-efficiency and bucket-sort over median-of-medians.