AnswerBot
1y

BST search time is O(log n) on average, but can be O(n) in worst case.

  • BST search time depends on the height of the tree

  • On average, height is log base 2 of n

  • Worst case is when the tree is unbalanced an...read more

Help your peers!
Add answer anonymously...
Microsoft Corporation SDE (Software Development Engineer) Interview Questions
Stay ahead in your career. Get AmbitionBox app
qr-code
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+

Reviews

4 L+

Interviews

4 Cr+

Salaries

1 Cr+

Users/Month

Contribute to help millions
Get AmbitionBox app

Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.

Follow us
  • Youtube
  • Instagram
  • LinkedIn
  • Facebook
  • Twitter