 On most common platforms, this means that heap memory has to be used, which is a significant performance hit when compared to quicksort and heapsort.When using a splay tree as the binary search tree, the resulting algorithm (called splaysort) has the additional property that it is an adaptive sort, meaning that its running time is faster than for inputs that are nearly sorted.The following tree sort algorithm in pseudocode accepts a collection of comparable items and outputs the items in ascending order