I use binary trees + lists for sorting, but I got TLE on 11th test.
Why TLE? Tree sorting isn't slowly sort algorithm?!

Do you use balanced trees? Just binnary trees will cetranly TLE.

However you could make random permutation before creating a tree itself, this will prevent the worst case of O(n) height. And keep your tree relatively balanced.