answersLogoWhite

0

In the worst case a binary search tree is linear and has a height equal to the number of nodes. so h=O(h).

User Avatar

Wiki User

11y ago

Still curious? Ask our experts.

Chat with our AI personalities

FranFran
I've made my fair share of mistakes, and if I can help you avoid a few, I'd sure like to try.
Chat with Fran
RossRoss
Every question is just a happy little opportunity.
Chat with Ross
DevinDevin
I've poured enough drinks to know that people don't always want advice—they just want to talk.
Chat with Devin

Add your answer:

Earn +20 pts
Q: What is the height of binary search tree in worst case?
Write your answer...
Submit
Still have questions?
magnify glass
imp