Question: PROBLEM 3: Define a node of a binary tree to be full if it has both a left and a right child. Prove by induction

PROBLEM 3: Define a node of a binary tree to be full if it has both a left and a right child. Prove by induction that the number of full nodes in any non-empty binary tree is 1 fewer than the number of leaves (number-of-full-nodes (number-of-leaves 1)) Some examples given below #Full-Nodes: #Leaves: 1 0 #Full-Nodes: 0 #Leaves: 1 #Full-Nodes: #Leaves: 2 1 #Full-Nodes: #Leaves: 2 1
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
