Question: Write a C++ function for the following question: A full node in a binary tree has either no children or exactly 2 children. Given a
Write a C++ function for the following question:
A full node in a binary tree has either no children or exactly 2 children.
Given a binary tree, write a function that returns true if all nodes are full nodes. Otherwise return false.
Notes: The function should have just one argument, a pointer to the root. No global variables may be used. No additional functions may be defined.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
