A 3-ary tree is a tree in which every internal node has exactly three…
GATE · 1994 · CS · Descriptive A
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.
Sign up free to check your answer
Sign up freeLoading lesson…