BTechibtechi.in
Loading Loading
Free IIT Madras BS notes, PYQs and mock tests at btechi.in

PDSA · Binary trees, BST & AVL trees

18 questions · 68 marks · 6 papers

Answer key

Indian Institute of Technology Madras

BS Degree Programme · Examination & Study Paper

Programming, Data Structures and Algorithms using Python

Binary trees, BST & AVL trees

Official Paper

Examination Instructions & Guidelines

Solve on notebook/paper first before checking solutions.
MCQ: Exactly 1 option is correct. Negative marking applies.
MSQ: One or more options correct. Select all to score.
NAT: Numerical response. No negative marking.
Scientific calculator allowed for all calculations.
Official answer key is sealed at the end of this sheet.

End Term · 31 Aug 2025 (FN)End Term

Q1MSQ4 Marks·Choose all correct options
Asked 3 times Key ↓
1. A10
2. B20
3. C22
4. D25
5. E40
Q2NAT4 Marks·Write the number
Asked 3 times Key ↓
A binary tree has 7 nodes. What is the minimum possible height of this tree (assuming the empty tree height is 0)?
Your answer:

End Term · 31 Aug 2025 (AN)End Term

Q3MSQ4 Marks·Choose all correct options
Asked 3 times Key ↓
1. A2
2. B3
3. C4
4. D5
5. E9
Q4NAT4 Marks·Write the number
Asked 3 times Key ↓
What is the minimum possible height of a binary tree with 12 nodes (assuming the empty tree height is 0)?
Your answer:

Quiz 2 · 3 Aug 2025 (AN)Quiz 2

Q5MCQ3 Marks·Choose one option
Key ↓
1. A7
2. B8
3. C9
4. D10
Q6MCQ3 Marks·Choose one option
Asked 3 times Key ↓
1. A
2. B
3. C
4. D
Q7MSQ3 Marks·Choose all correct options
Key ↓
1. A
2. B
3. C
4. D
Q8NAT3 Marks·Write the number
Asked 3 times Key ↓
Your answer:

End Term · 13 Apr 2025 (AN)End Term

Q9MCQ4 Marks·Choose one option
Key ↓
1. A8
2. B7
3. C6
4. D5
Q10MCQ4 Marks·Choose one option
Key ↓
While inserting the elements [13, 7, 26, 33, 5, 10, 12, 11, 9] in an empty binary search tree (BST) in the sequence shown, the element at maximum depth is__.
1. A33
2. B9
3. C11
4. D5
Q11MCQ4 Marks·Choose one option
Asked 3 times Key ↓
1. A4
2. B5
3. C11
4. D12

End Term · 22 Dec 2024 (FN)End Term

Q12MCQ4 Marks·Choose one option
Asked 2 times Key ↓
1. AOnly statement I is true
2. BOnly statement II is true
3. CBoth statements are true
4. DBoth statements are not true
Q13MCQ4 Marks·Choose one option
Asked 2 times Key ↓
Which of the following statement(s) is/are correct about the traversals in a binary search tree? 1. The inorder traversal sorts the elements in descending order. 2. The root of the tree is always the first element of the postorder traversal.
1. AOnly statement 1 is correct
2. BOnly statement 2 is correct
3. CBoth the statements are correct
4. DNone of the statements are correct
Q14NAT4 Marks·Write the number
Key ↓
Your answer:
Q15NAT4 Marks·Write the number
Asked 3 times Key ↓
Your answer:

End Term · 22 Dec 2024 (AN)End Term

Q16MCQ4 Marks·Choose one option
Asked 2 times Key ↓
1. AOnly statement I is true
2. BOnly statement II is true
3. CBoth statements are true
4. DBoth statements are not true
Q17MCQ4 Marks·Choose one option
Asked 2 times Key ↓
Which of the following statement(s) is/are correct about the traversals in a binary search tree? 1. The root of the tree is always the first element of the inorder traversal. 2. The root of the tree is always the last element of the postorder traversal.
1. AOnly statement 1 is correct
2. BOnly statement 2 is correct
3. CBoth the statements are correct
4. DNone of the statements are correct
Q18NAT4 Marks·Write the number
Asked 3 times Key ↓
Your answer:

Official Key

Master Answer Key & Explanations

Official answer keys from IIT Madras BS past papers. Click any question to review.

Reveal Key

Q1A, C, E

Q23

Q3A, D, E

Q44

Q5A

Q6B

Q7A, B

Q831

Q9C

Q10C

Q11B

Q12C

Q13D

Q1415

Q1531

Q16A

Q17B

Q1820

Questions and answer keys are reproduced from the official IIT Madras BS papers. Topics and repeated question types are BTechi’s own grouping. BTechi is not affiliated with IIT Madras.