Q111
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
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board