A tree sort is a sort algorithm that buils a binary search tree from the keys to be sorted, and then traverses the tree so that the keys come out in sorted order. Adding items to a binary search tree is an O(log(n)) process, so, therefore, adding n items becomes an O(nLog(n)) process, making Tree Sort a so-called, 'fast sort'.