Quiz Space

Database Management Systems · Quiz 2 · 3 Aug 2025 · May 2025 term · Set 1

Question 10: Construct a binary search tree by inserting the values i…

Question 10

+4 marksOne or more correct options

Construct a binary search tree by inserting the values in the following order 15,14, 30, 5, 13, 19, 26, 12, 1, 6. Which of the following statement(s) is/are correct? Note: Consider the root node at level 0.

Select all that apply.

  1. A

    The height of binary search tree is 6.

  2. B

    The sum of the leaf nodes of the binary search tree is 33

  3. C

    The nodes 12,1 and 6 are part of the left subtree of node 13.

  4. D

    Node 19 is at level 2

Show answer

Correct answers

  • B

    The sum of the leaf nodes of the binary search tree is 33

  • D

    Node 19 is at level 2

See the whole paperTake it as a mock test

Question 10 of 15 in the IIT Madras BS Database Management Systems (DBMS) Quiz 2 paper sat on 3 Aug 2025, in the May 2025 term (IIT M IMPROVEMENT AN EXAM QIV4 03 Aug). It carries 4 marks.

This question was also asked in

More questions from this paper

  1. Q1THIS IS QUESTION PAPER FOR THE SUBJECT "DIPLOMA LEVEL : DATABASE MANAGEMENT SYSTEMS (COMPUTER BASED EXAM)" ARE YOU SURE…
  2. Q2Figure question
  3. Q3Figure question
  4. Q4Figure question
  5. Q5Figure question
  6. Q6Figure question
  7. Q7Figure question
  8. Q8Figure question
  9. Q9Figure question
  10. Q11Figure question
  11. Q12Identify the correct statement(s):
  12. Q13Figure question
  13. Q14Consider a binary search tree consisting of 31 elements. Let m be the maximum height possible for a given binary search…
  14. Q15Figure question