How to find number of full binary tree with n nodes?
Answers
Answered by
0
Answer:
Explanation:
Assuming that a full binary tree has 2^k nodes at each level k. Total number of nodes, N = 2^0 + 2^1 + 2^2 + ……… + 2^h , where h is the height of the full binary tree. Let's assume the height of the tree to be 2.
Similar questions
Business Studies,
5 months ago
English,
5 months ago
Biology,
11 months ago
Math,
11 months ago
Math,
1 year ago