Question: Q 1 . A strictly binary tree is defined as a tree whose nodes are either leaf nodes or have 2 children. Write a recursive
Q A strictly binary tree is defined as a tree whose nodes are either leaf nodes or have children. Write a recursive member function for the BinaryTree class that returns true if a tree is a strictly binary tree, false otherwise.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
