Devon's Clog?

My Take On the FBT Example

Instead of looking at breaking the binary tree down into smaller trees of the same properties, I looked at the relationship between siblings. Every node aside from the root has exactly one sibling. Because of this we can assert that there are an even number of nodes with siblings. The even number of nodes plus the root which has no sibling results in a tree with an odd number of nodes for every full binary tree.

Also, Mars food is delicious.

Comments (View)
blog comments powered by Disqus