Vidyalelo
Data Structure · Q458

Sorting Algorithms

Programming · Data Structure · question 458

Q458

The worst case time complexity of tree sort remains unaffected when implemented with an unbalanced tree or a balanced tree.

A.
True
B.
False
Answer

Answer: Option B

Solution

Answer: Option B
No explanation is given for this question Let's Discuss on Board