Given a Binary Tree of size N , You have to count leaves in it. For example, there are two leaves in following tree
Given Tree is
/ / \
7 5 1
Three leaves are 3 , 5 and 1.
You don't have to take input. Complete the function countLeaves() that takes root node of given treeas parameter and returns the count of leaves in tree . The printing is done by the driver code.
1<= N <= 104
Note:The Input/Ouput format and Example given below is used for system's internal purpose, and should be used by a user for Expected Output only. As it is a function problem, hence a user should not read any input from stdin/console, and should not print anything on stdout/console. The task is to complete the function specified, and not to write the full code.