Question 3
While inserting the elements 60, 30, 50, 55, 80, 90, 65, 70, and 10 into an empty binary search tree (BST) in the sequence shown, the sum of elements at maximum depth is __.
Question 3: While inserting the elements 60, 30, 50, 55, 80, 90, 65, …
Show answer
Correct answer: 125
Question 3 of 24 in the IIT Madras BS Programming, Data Structures and Algorithms using Python (PDSA) End Term paper sat on 10 May 2026, in the January 2026 term (Programming, Data Structures And Algorithms Using Python 10 May 26). It carries 4 marks.
More questions from this paper
- Consider the following function:
- In a binary tree, the total number of nodes is 28. It is known that 10 nodes have exactly two children.\ How many nodes…
- How many bits will be used to encode the message ABCDE using Huffman codes?
- Figure question
- Figure question
- Figure question
- Figure question
- Figure question
- Run BFS starting from vertex A. If multiple adjacent vertices exist, they are visited in alphabetical order.\ Which of …
- Figure question
- The Bellman-Ford algorithm cannot be used if a graph has negative cycles. This is because:
- While inserting the elements 8, 4, 1, 3, 9, 2, and 11 in an empty AVL tree in the given sequence, the leaf elements are.
- Figure question
- Figure question
- Figure question
- Figure question
- Figure question
- Let G be a simple graph with 25 vertices and 50 edges. The size of the minimum vertex cover of G is 10. What is the siz…
- Which of the following could be possible insertion orders that produce this table?
- A technology training institute offers an advanced certification program consisting of 10 modules. The program is divid…
- Figure question
- Consider the following graph. Which of the following options correctly represents the shortest distances from node 0 to…
- Consider the graph G given below. Let Minimum Spanning Trees (MSTs) of the graph be constructed using algorithms such a…