Which of the following version of tree sort will have the highest worst case time complexity?
Posted: Wed Jul 13, 2022 6:15 pm
a) using AVL tree as BST
b) using red black tree as BST
c) using splay tree as BST
d) using ordinary BST
b) using red black tree as BST
c) using splay tree as BST
d) using ordinary BST