Opening the paper…

Programming, Data Structures and Algorithms using Python, End Term

January 2026 term, 10 May 2026, Set 1

Learning mode

Question 1

+4−0Numerical answer

Consider the following function:

The function is called as:

How many recursive calls will be made by the function excluding the first main call?

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: 2

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: 2

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 The function is called as: Figure from the original question paper How many recursive calls will be made by the function excluding the first main call? In a binary tree, suppose there are: 14 nodes with two children, and• 6 nodes with exactly one child.• How many leaf nodes does the tree have? 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\_\_\_\_.