What is the worst-case time complexity of searching in a balanced Binary Search Tree with n nodes ?
Asked in TPSC Junior System Engineer 2026
Answer under review: our editors are checking this question. Try the other TPSC Prelims previous year questions questions meanwhile.
More TPSC Prelims previous year questions questions
- In a B+ tree of order m, what is the minimum number of ke's in anv non-root internal node ?
- Which sorting algorithm achieves O(n) time complexity in the best case and is stable ?
- In a doubly linked list, deleting a node given only a pointer to that node (not to its predecessor) has time complexity
- The nost-order traversal of a Binavr Search Tree having keys. 10, 20, 5, 15, 1 (inserted in this order) yields which sequence ?
- Which of the following graph representations is most efficient for a sparse graph with V vertices and E edges where E << V^2 ?
- A min-heap contains n elements. What is the time complexity of extracting all elements in sorted order (heap sort) ?
- Which hashing technique handles collisions by computing a second hash function to find the next probe position ?
- In Quick Sort, choosing the pivot as the median-of-three reduces the probability of O(n²) worst-case. Under what input condition does Quick Sort still degrade to O(n²) ?