GateQA is a free GATE CS preparation platform featuring 3,500+ previous-year questions (1987–2026),
36,000+ aptitude questions, subject-wise and year-wise mock tests, performance analytics,
and full offline support. Practice Operating Systems, Algorithms, DBMS, Computer Networks,
Theory of Computation, Discrete Mathematics, Compiler Design, Digital Logic, and more.
Let $T$ be a binary search tree with $15$ nodes. The minimum and maximum possible heights of $T$ are: Note: The height of a tree with a single node is $0$ .
Answer: B
This static SEO snapshot loads the full interactive GateQA app when JavaScript is available.