Question 3
While inserting the elements 50, 80, 20, 60, 10, 45, 65, 30, and 90 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 50, 80, 20, 60, 10, 45, 65, …
Show answer
Correct answer: 95
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: The function is called as: How many recursive calls will be made by the function exclu…
- In a binary tree, suppose there are: 14 nodes with two children, and• 6 nodes with exactly one child.• How many leaf no…
- How many bits will be used to encode the message ABCDE using Huffman codes?
- Figure question
- Figure question
- Figure question
- Figure question
- Figure question
- Figure question
- Run DFS starting from vertex A. If multiple adjacent vertices exist, they are visited in alphabetical order.\ Which of …
- Figure question
- Figure question
- You are given the following list of 8 meeting requests with start time, and end time.
- Figure question
- Figure question
- Figure question
- Which of the following could be possible insertion orders that produce the above hash table?
- A data science bootcamp offers 6 learning modules. Students must complete modules according to the prerequisite structu…
- Consider the following graph. Suppose Dijkstra’s algorithm is executed with vertex 0 as the source vertex.\ Which of th…
- Which of the following is/are always true about the Floyd-Warshall algorithm?
- Consider the graph G given below. Let Minimum Spanning Trees (MSTs) of the graph be constructed using algorithms such a…
- Let C be a problem that belongs to the class NP. Which of the following statement(s) is/are TRUE?
- Figure question