If a binary search tree is not balanced, it may be less efficient than a linear structure.

Name: If a binary search tree is not balanced, it may be less efficient than a linear structure.
Brand: Quizplus
Rating: 4.8 (33 reviews)

Question

Quizplus · Accepted Answer

A binary search tree that is not balanced can have a worst-case search time complexity of O(n), making it less efficient than a linear structure for search operations, which also has a time complexity of O(n) but with potentially lower overhead.

If a Binary Search Tree Is Not Balanced, It May