Question: Given a pointer to a binary tree write a routine which will traverse the tree and return number of nodes in the tree who have
Given a pointer to a binary tree write a routine which will traverse the tree and return number of nodes in the tree who have just a right son or just a left son (do not include nodes that have both right and left sons as well as do not include any nodes that do not have any sons at all)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
