Finding cities in a tile with binary search trees.
C
Binary Search Trees
The goal of the project was to write three algorithms to find all the cities included in a rectangular tile delimited by the points of latitude and longitude (φ 1, λ 1), (φ 2, λ 1), (φ 1, λ 2), (φ 2, λ 2).