GATE CSE · 2026 · CS2
Question 49: Programming and Data Structures
Give it a try, then reveal the answer to check your work.
Question 49
CS2MSQ2 marksNeeds review
Consider a binary search tree (BST) with
leaf nodes (
). Given any node
, the key present in the node is denoted as
. All the keys present in the given BST are distinct. The keys belong to the set of real numbers.For a node
, let
denote the node that is its inorder successor. If a node
does not have an inorder successor, then
is
. As there are no duplicates, if
is not
, then
.Corresponding to every leaf node
that has a non-NULL
, a new key
with the following property is to be inserted into the BST.
Let
represent the list of all such new keys to be inserted into the BST.Which of the following statements is/are true?
Your answerSelect all correct options. You can choose more than one.
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerEXPLORE & PRACTISE
Paper and topic context
See where this question comes from and choose what to practise next.
2026CS2
GATE CSE 2026 · Paper 2
Computer Science and Information Technology · Original paper archive
- Section
- Section CS2
- Question type
- Multiple select (MSQ)
- Marks
- 2 marks
Practise related topics
Explore more previous year questions using this question’s imported topic tags.
computer science
GATE CSE previous year questions
information technology
GATE CSE previous year questions
computing
GATE CSE previous year questions
programming data structures
GATE CSE previous year questions
binary search trees
GATE CSE previous year questions
Programming and Data Structures
GATE CSE previous year questions
Comments
Ask a question, share your approach, or help someone understand.
Log in to view the discussion
You’re not logged in. Log in or create an account to see discussions and add comments.