Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...

how to find the number of possible tree in the given tree.

Answer Posted / vikram_tp

you all are going wrong...
the formula which u have given is only working when n=2 or 3..
bt when n=4 the ans should be 14 not 12
when n=5 ans is 42 and not what comes by the formula...
so there isnt any formula for this..u have to count then by generating the trees by urself...

Is This Answer Correct ?    18 Yes 0 No



Post New Answer       View All Answers


Please Help Members By Posting Answers For Below Questions

Why do we Use a Multidimensional Array?

854


What is raid (redundant array of inexpensive disks)?

955


What is the difference between the hash table and hash map?

963


What is the difference between dictionary and hashtable?

979


What is scalar data type?

970


How do you use the sort function?

812


What is red black tree in data structure?

875


Explain the applications of stack?

909


Can arraylist be empty?

845


What is stack and its operations?

819


How is a hashset implemented?

904


Which sorting does collections sort use?

869


Define an equivalence relation?

1055


How can you add an item to the beginning of the list?

974


Give a good data structure for having n queues ( n not fixed) in a finite memory segment. You can have some data-structure separate for each queue. Try to use at least 90% of the memory space.

917