Root out the roots II
A fully connected binary tree is one where every node has either no children at all or exactly two children.
Consider a rooted fully connected binary tree with 10 leaves. How many nodes in this tree are there where the tree can be re-rooted making sure that the tree is still a binary tree (but not necessarily fully connected)?
Clarification: A fully-connected binary tree is that whose nodes have either two or no children.
The problem is a part of this set
The answer is 11.
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.
0 solutions
No explanations have been posted yet. Check back later!