Statement 1 : A Binary Search Tree (BST) always en...
Guiding State PSC aspirants since 2016 50,000+ students · 1,000+ final selections Exam Calendar Results Call 9116926003
pscnotes
Pick your state
APPSC Prelims previous year questions

Statement 1 : A Binary Search Tree (BST) always ensures O(log n) searching. Statement 2 : Every BST maintains balance automatically after insertion. Choose the correct option.

Asked in APPSC (Arunachal) Question Booklet (Set-A) of Paper I and Paper II 2026

  1. Both Statement 1 and Statement 2 are correct
  2. Statement 1 is correct, but Statement 2 is incorrect
  3. Statement 1 is incorrect, but Statement 2 is correct
  4. Both Statement 1 and Statement 2 are incorrect
Show answer

Answer: D. Both Statement 1 and Statement 2 are incorrect

More APPSC Prelims previous year questions questions

All 7,479 APPSC Prelims previous year questions questions →