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
Show answer
Answer: D. Both Statement 1 and Statement 2 are incorrect
More APPSC Prelims previous year questions questions
- A Layer-2 switch avoids collisions by
- Which multiplexing technique(s) is/are used in GSM?
- Mobile Ad Hoc Networks (MANETs) primarily differ from infrastructure Wi-Fi because they
- Which topology ensures deterministic access control?
- In a mesh topology, how many links are required for N computers?
- DHCP stands for
- Which of the following protocols uses a 3-way handshake?
- Statement 1 : Gateway worked as a protocol converter. Statement 2 : Gateway causes no time delay during protocol conversion. Choose the correct option.