Opening the paper…

Programming, Data Structures and Algorithms using Python, End Term

January 2026 term, 10 May 2026, Set 1-2

Learning mode

Question 1

+4−0Numerical answer

Consider the following function:

Your answer

Report a problem

to report a problem with this question.

Choose a question

Answered: 0
Not answered: 1
Marked for review: 0
Answered & marked for review: 0
Not visited: 23

Discussion

Submit this paper?

You cannot change your answers after submitting.

Answered: 0
Not answered: 1
Marked for review: 0
Answered & marked for review: 0
Not visited: 23

Instructions

The palette shows the status of every question. Pick a number to go straight to it.

Answered: 0
Not answered: 1
Marked for review: 0
Answered & marked for review: 0
Not visited: 23

Save & Next moves to the next question. Answers are saved as you go.
Mark for Review & Next flags the question to come back to. A flagged answer still counts.
Clear Response removes your answer to the question on screen.
The ← and → keys move to the previous and next question.

Consider the following function: Figure from the original question paper Question text from the original paper, with its maths as pictures In a binary tree, the total number of nodes is 28. It is known that 10 nodes have exactly two children.\ How many nodes have exactly one child? 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 \_\_.