Data Structures | Binary Search Trees | Question 3

Last Updated :
Discuss
Comments

We are given a set of n distinct elements and an unlabelled 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? (GATE CS 2011)

0

1

n!

(1/(n+1)).2nCn

This question is part of this quiz :

Top MCQs on Binary Search Tree (BST) Data Structure with Answers
Tags:
DSA Quiz
Data Structures
GATE CS
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy