I am trying to write a formula to find:
“The number of structurally different binary trees that can exist with nodes that have either 0 or 1 children”.
How would I go about doing this?
Share
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.
I am trying to write a formula to find:
“The number of structurally different binary trees that can exist with nodes that have either 0 or 1 children”.
How would I go about doing this?
Seems to me that a “binary tree” that has nodes with only 0 or 1 children is a chain. If by “structurally different” you mean that you treat differently whether a given non-terminal node has a left child or a right child, then observe that you can describe that tree with a binary number that is N-1 bits long. So the number of different trees for a given N would be 2**N-1.
(And, obviously, if you mean how many different “shapes” of the “tree” can exist for a given N, the answer is 1.)