0
/ 10

Write a recursive function to count the number of leaf nodes in the binary tree pointed at by "root". Assume there is "isLeaf" method to...

Write a recursive function to count the number of leaf nodes in the binary tree pointed at by "root". Assume there is "isLeaf" method to check if the node is leaf or not. You must use the "isLeaf" method. That is, do not check the value of the left and right children to see if they are null or not to decide if the node is a leaf.

Your feedback will appear here when you check your answer.