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

12y ago

Still curious? Ask our experts.

Chat with our AI personalities

JudyJudy
Simplicity is my specialty.
Chat with Judy
ProfessorProfessor
I will give you the most educated answer.
Chat with Professor
JordanJordan
Looking for a career mentor? I've seen my fair share of shake-ups.
Chat with Jordan

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