Tree sort

From Wikipedia, the free encyclopedia

A tree sort is a sort algorithm that builds 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'.

v • d • e Sorting algorithms Theory Computational complexity theory | Big O notation | Total order | Lists | Stability | Comparison sort Exchange sorts Bubble sort | Cocktail sort | Odd-even sort | Comb sort | Gnome sort | Quicksort Selection sorts Selection sort | Heapsort | Smoothsort | Strand sort Insertion sorts Insertion sort | Shell sort | Tree sort | Library sort | Patience sorting Merge sorts Merge sort Non-comparison sorts Radix sort | Bucket sort | Counting sort | Pigeonhole sort | Tally sort Others Topological sorting | Sorting network | Bitonic sorter Ineffective/jokeful sorts Bogosort