Data Structures and Algo C++

1)Tree Sort algorithm is used to get the sorted data from a binary Search Tree either in an ascending order or the descending order. Write code or a function to implement the Tree sort for descending order given a valid BST. Store the sorted data into an integer array SArray.

2)Heapsort is another way to do the sorting. Compare the TreeSort and HeapSort algorithms to find out which one is efficient. You can assume that the Tree and Heap is available, and you just need to do the sorting.