Computer Science, asked by arumughan299, 1 year ago

The maximum number of binary trees that can be formed with n unlabeled nodes is

Answers

Answered by Anonymous
4

Answer:

BT(n) = (C(2n,n)/n+1)*n! Total number of binary tree possible with 3 nodes are 30. Note:— If the nodes are unlabeled then Total number of binary tree with n nodes is equal to total number of BST with n nodes.

Similar questions