Find the minimum leaf node in a BINARY TREE (NOT A BINARY SEARCH TREE) in C

given function prototype

node* findleaf(node* root)

{

if (root == NULL)

{

return NULL

}

}

IN THE NEXT ONE RETURN THE VALUE

int findleaf(node* root)

{

if (root == NULL)

{

return 0

}

}

PLEASE KEEP SOLUTION AS SIMPLE AS POSSIBLE WITH RECURSION