What is the worst case time complexity of the binary tree sort?
BPSC TRE · TRE 3.0 · Classes 6–10 (SC/ST Welfare Dept) · Computer · 22 Jul 2024 · Shift 2 · Subject
What is the worst case time complexity of the binary tree sort?
- A.
O(n)
- B.
O(nlogn)
- C.
O(n²)
- D.
More than one of the above
- E.
None of the above
Attempted by 69 students.
Sign up free to check your answer
Sign up freeLoading lesson…