Aspire Faculty ID #17695 · Topic: JECA MCA 2025 · Just now
JECA MCA 2025

What is the worst case time complexity to access an element in a binary search tree?

Solution

Unbalanced BST → O(n).

Previous 10 Questions — JECA MCA 2025

Nearest first

Next 10 Questions — JECA MCA 2025

Ascending by ID
Ask Your Question or Put Your Review.

loading...