Open In App

GATE | GATE CS 2011 | Question 29

Like Article
Like
Save
Share
Report

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?
(A) 0
(B) 1
(C) n!
(D) (1/(n+1)).2nCn


Answer: (B)

Explanation: See https://www.geeksforgeeks.org/data-structures-and-algorithms-set-26/

Quiz of this Question


Last Updated : 06 Sep, 2021
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads