Nodes, Children And Leaves
Computer Science
Level
2
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 \(\text{_________} \).
by
Satyabrata Dash