Tango trees in Computer Science

I was reading about specialized variants of Dijkstra’s algorithm when I saw the name Van Emde Boas and it grabbed my interest.

I skimmed that page and saw another article in the “See also” section: Tango tree.

A tango tree is a type of binary search tree proposed by Erik D. Demaine, Dion Harmon, John Iacono, and Mihai Pătrașcu in 2004.[1]

As for its etymology:

It is named after Buenos Aires, of which the tango is emblematic.

It’s a shame tango trees and dancing links haven’t had the chance to meet :)