二叉树：计算叶子节点个数

struct node {
	int val;
	node *left, *right;
};
int countLeaf(node *root) {

if (!root)  return 0;

else {

if (!root->left && !root->right) return 1;

return countLeaf(root->left) + countLeaf(root->right);

}

}