In binary tree sort, we first construct the BST and then we perform _______ traversal to get the sorted order.
(a) inorder
(b) postorder
(c) preorder
(d) level order
This question was addressed to me by my college director while I was bunking the class.
My query is from Sorting topic in portion Sorting of Data Structures & Algorithms II