For example, novel algorithms have been developed that leverage the induced sorting principle, achieving reduced time and workspace complexities even when handling sparse data sets [1].

Both a sorted array and a binary tree can let you look up an element in log(N) time. However I would expect a sorted array to be faster in practice because of the constant factor. However ...

The methods are illustrated by comparing the proposed algorithms with previously studied hierarchical and two-dimensional array algorithms for detecting recent HIV infections in North Carolina.