Like Morris traversal if current does not have left child rather than printing as we did in inorder , we will just increment the count as the number will be in an increasing order
if ( curr -> left == NULL ) { count ++ ;