2 votes 2 votes In a complete $k$-ary tree, every internal node has exactly $k$ children. The number of leaves in such a tree with $n$ internal nodes is $nk$ $(n-1)k+1$ $n(k-1)+1$ $n(k-1)$ DS nielit2017july-scientistb-cs data-structures tree + – admin asked Mar 30, 2020 retagged Oct 28, 2020 by Krithiga2101 admin 750 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes every internal node is $k$ children Total node$ =nk+1$(1 is for root) $leaves$ =$total$ $node$ - $internal $ $node$ $ =nk+1-n$ $ =n(k-1)+1$ $leaves node$ = $internal$ $node$ * $(k-1)+1$ https://gateoverflow.in/1372/gate2005-36 https://gateoverflow.in//1683/gate1998-2-11#viewbutton https://www.geeksforgeeks.org/g-fact-42/ Mohit Kumar 6 answered May 31, 2020 Mohit Kumar 6 comment Share Follow See all 0 reply Please log in or register to add a comment.