Tree sort Algorithm

Tree sort algorithm is an online sorting algorithm that builds a binary search tree from the elements to be sorted, and then traverses the tree (in-order) so that the elements come out in sorted order.

The average case time complexity is O(N log N) and the auxiliary space complexity is O(N).

Refer the article for more details and implementations.

Share your thoughts or ask any questions below.
This is a companion discussion topic for the original entry at