The following algorithm seeks to compute the number of leaves in a binary tree.

Algorithm LeafCounter(T)

//Input: A binary tree T

//Output: The number of leaves in T

//Note that T_L and T_R indicate the left subtree and

//right subtree of the tree T.

if T =

return 0

else

return LeafCounter(T_L)+ LeafCounter(T_R)

But the algorithm is not correct. Rewrite the algorithm to correctly compute the number of leaves in a binary tree.