Tree Sort An algorithm that sorts by inserting items into a binary search tree Best Case: O(n log n) Average Case: O(n log n) Worst Case: O(n^2) In-Place: No Stable: Yes
