Question: Q4. Write a recursive function that returns the count of number of nodes with only one child in a binary tree whose root node is

Q4. Write a recursive function that returns the count of number of nodes with only one child in a binary tree whose root node is pointed by tl. Use following structure for the node of a binary tree. struct TreeNode \ int Data; TreeNode *leftChild; TreeNode "rightChild; //write the body of the following functionnm int countNodes WithOnlyOneChild(TreeNode *t1)i
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
