Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
binary tree, where each node has at most two child nodes, child nodes may contain references to their parents.
we do not differentiate the nodes and all nodes are considered identical. How can we find the number of different binary trees that can be formed with N identical nodes.
eg: if 3 nodes then 5 diff trees
if 7 nodes then 429 trees
Now, if you really want to understand this, instead of just getting (or experimenting to find) the answer, you can check out “The Art of Computer Programming”, Volume 4, Fascicle 4: Generating all trees.