Home Previous Year GATE CSE

Menu

Home Previous Year

GATE CSE

All subjects Operating Systems132 DBMS122 Computer Networks142 Algorithms128 Programming & Data Structures195 Theory of Computation122 Compiler Design95 Computer Organization & Architecture131 Digital Logic91 Discrete Mathematics133 Engineering Mathematics139 General Aptitude260

Coming soon

BookmarksSoon

My progressSoon

PYQ Hub · Previous year questions, organised for practice.Every question lists its source.

Trees & BST (Programming & Data Structures): GATE CSE PYQs | PYQ Hub

Operating Systems132

Computer Networks142

Programming & Data Structures195

Theory of Computation122

Compiler Design95

Computer Organization & Architecture131

Digital Logic91

Discrete Mathematics133

Engineering Mathematics139

General Aptitude260

Home
Previous Year
GATE
CSE
Programming & Data Structures
Trees & BST

GATE CSE previous year questions · Programming & Data Structures

Trees & BST

40 questions

Filters & sort1

FiltersClear all

Year

2026 2025 2024 2023 2022 2021 2020 2019

1

GATE CSE 2011 | Question 29

MCQ2 marks

We are given a set of

n

distinct elements and an unlabeled binary tree with

n

nodes. In how many ways can we populate the tree with the given set so that it becomes a binary search tree?

Single correct

Answer key coming soon

Source: GATE CSE 2011, IIT Madras. Official question paper.

Use ← → to move

Questions

1 total

Correct Wrong Answer seen

FiltersClear all

Year

2026 2025 2024 2023 2022 2021 2020 2019

Set

Set 1 Set 2 Set 3

Set

Set 1 Set 2 Set 3

Marks

Marks

Question type

Question type