Engineering-Mathematics
August 15, 2024Engineering-Mathematics
Question 12 |
A 3-ary tree is a tree in which every internal node has exactly three children. Use induction to prove that the number of leaves in a 3-ary tree with n interval nodes is 2(n-1)+3.
Theory Explanation. |
Correct Answer: A
Subscribe
Login
0 Comments