Skip to content
Related Articles

Related Articles

Improve Article

GATE | GATE CS 2011 | Question 29

  • Last Updated : 06 Sep, 2021

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

Attention reader! Don’t stop learning now.  Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.

Learn all GATE CS concepts with Free Live Classes on our youtube channel.

My Personal Notes arrow_drop_up
Recommended Articles
Page :