Leaves To Children

Computer Science Level 2

A certain binary tree has n n leaves. What is the number of nodes in that tree having two children?

n − 3 n-3 between ⌊ n 2 ⌋ \left\lfloor \frac { n }{ 2 } \right\rfloor and n n n − 1 n-1 n − 2 n-2

Beakal Tiliksew by Beakal Tiliksew , 24, Ethiopia

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Aditya Kumar
Feb 8, 2016

The number of nodes with two children is always one less than the number of leaves.

We can use Handshaking Lemma to prove it.

3 Helpful 0 Interesting 0 Brilliant 0 Confused

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...