Which of the following version of tree sort will have the highest worst case time complexity?
(a) using AVL tree as BST
(b) using red black tree as BST
(c) using splay tree as BST
(d) using ordinary BST
This question was addressed to me in exam.
My question is based upon Sorting in portion Sorting of Data Structures & Algorithms II