A binary search tree can be used to sort a list. WE simply insert the list elements into a BST, initially empty, and then use an inorder traversal to copy them back into the list. Write an algorithm for this treesort method of sorting, assuming that the list is stored in
a. an array
b. a linked list
any tips, suggestions, help is very much appreciated
Merci beau coup!