Binary tree sort implemented using a self balancing binary search tree takes O(n log n) time in the worst case but still it is slower than merge sort. - Study24x7
Social learning Network
study24x7

Default error msg

Login

New to Study24x7 ? Join Now
Already have an account? Login
26 Mar 2019 10:02 AM study24x7 study24x7

Binary tree sort implemented using a self balancing binary search tree takes O(n log n) time in the worst case but still it is slower than merge sort.

A

true

B

false

study24x7
Write a comment
Related Questions
500+   more Questions to answer
Most Related Articles