Question: A full node is a node with two children. Use mathematical induction to prove that the number of full nodes F plus one is

A full node is a node with two children. Use mathematical induction  

A full node is a node with two children. Use mathematical induction to prove that the number of full nodes F plus one is equal to the number of leaves L in a nonempty binary tree. [Remember: There are three types of nodes in a binary tree: full node, half node and leaf.]

Step by Step Solution

3.41 Rating (157 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

Note My Convention no Of full node FF no Of leaf node LL Base Case H0H0 A bi... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Algorithms Questions!