Tango trees work by partitioning a binary search tree into a set of preferred paths, which are themselves stored in auxiliary trees (so the tango tree is represented as a tree of trees).
Tango stablo funkcioniše tako što particioniše binarno pretraživačko stablo u skup poželjnih staza koji su onda smeštena u pomoćna stabla (tako da je tango stablo predstavljeno kao stablo stabala).