Handshaking Tree

A complete \(k\)-ary tree is a tree in which each node has either \(k\) children or no children. If a certain tree has 65 leaves and 8 internal nodes what is the value of \(k\)?

×

Problem Loading...

Note Loading...

Set Loading...