How many different unrooted binary trees on are there on n vertices?

Question

Question

Answer 1

Answer #1

In an unrooted binary tree with n nodes, there will be n + 2 leaves.

n
therefore there are π (2i-5) unrooted binary trees with n nodes
i=3

if there are 3 nodes then there is 1 unrooted tree
if there are 4 nodes then it has 15 unrooted trees

Answer 2

Similar Homework Help Questions

How many different binary trees can be made from three nodes that contain the key values...

How many different binary trees can be made from three nodes that contain the key values 1, 2, and 3?
How many binary trees exist with n nodes and level k = 3? Justify your answer....

How many binary trees exist with n nodes and level k = 3? Justify your answer. Do not count isomorphic tree (ones with the same physical structure).
Binary Trees Problem 4. Binary Trees. [15 marks total Recall that a binary tree is defined...

Binary Trees Problem 4. Binary Trees. [15 marks total Recall that a binary tree is defined as a fintie set of nodes that is either empty or consists of a root and two disjoint binary trees T and TR, respectively, the left and right subtree of the root. Since the definition itself divides a binary tree into two smaller structures of the same type, the left and the right subtree, many problems about binary trees can be solved by applying...

Show that in Python, there are at least 2^n improper binary trees with n internal nodes...

Show that in Python, there are at least 2^n improper binary trees with n internal nodes such that no pair are isomorphic.
How many different patterns may be formed by coloring the vertices of a regular octagon using c c...

How many different patterns may be formed by coloring the vertices of a regular octagon using c colors? 13.2.1B How many different patterns may be formed by coloring the vertices of a regular octagon using c colors? 13.2.1B
explain how to get the answer A to this question. ^Binary Trees - Number of Compares...

explain how to get the answer A to this question. ^Binary Trees - Number of Compares ~Given the following numbers in array A ... 7 34 12 28 33 21 15 24 29 ... and using these numbers to draw a Binary Tree, how many compares will it take to find the 21? a. 5 b. 4 c. 6 d. 7 e. 9

Question 4 (1 point) How many binary search trees can you make from the three elements...

Question 4 (1 point) How many binary search trees can you make from the three elements e1, e2 and e3 assuming each tree maintains the ordering el 〈 e2 〈 e3 ? 14
Write a recursive function that compares two given binary trees. It returns 1 if the two...

Write a recursive function that compares two given binary trees. It returns 1 if the two trees are different, and it returns 0 otherwise. The function signature is: int treeDiff (node "a, node *b); Write a recursive function that counts how many nodes in a tree have a single child. The function signature is: int countoneChild(node "root);
How many different undirected graphs are possible with the same set of 5 vertices V =...

How many different undirected graphs are possible with the same set of 5 vertices V = {A, B, C, D, E}, but different sets of edges E?

. How many bits are required to represent 88 different objects in binary?

. How many bits are required to represent 88 different objects in binary?