Question: Please solve these practice problems using both PYTHON and simple Pseudocode. 1.) Write a recursive algorithm, countNodesWithTwoChildren(nodeType *root), that counts the number of nodes in
Please solve these practice problems using both PYTHON and simple Pseudocode.
1.) Write a recursive algorithm, countNodesWithTwoChildren(nodeType *root), that counts the number of nodes in a tree that have two children. The function should take as argument a pointer to the trees root node and return the number of nodes in the tree that have two children.
2.) Write a recursive algorithm, countNodesWithTwoChildren(nodeType *root), that counts the sum of nodes in a tree that have two children. The function should take as argument a pointer to the trees root node and return the sum of nodes in the tree that have two children.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
