Notices
Results 1 to 1 of 1

Thread: Binary search tree problem

  1. #1 Binary search tree problem 
    New Member
    Join Date
    Feb 2011
    Posts
    1
    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) 2nCn/(n+1)


    Is it B or D?


    Reply With Quote  
     

  2.  
     

Bookmarks
Bookmarks
Posting Permissions
  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •