GK Question

technology medium true_false

A binary search tree guarantees O(log n) search time even if elements are inserted in sorted order.

  1. True
  2. False

Answer: False

A standard BST degenerates to a linked list (O(n) search) if elements are inserted in sorted order. Balanced BSTs (AVL, Red-Black) maintain O(log n) by self-balancing after insertions/deletions. Understanding tree balancing is crucial for algorithm questions in SSC JE and banking IT exams.

Topic Data Structures
Exam Relevance SSC JE, Banking IT, Railway
More in technology Back to all questions