1,求叶子节点个数
int leafnum(Node* root)
{
if(root == NULL)
return 0;
if(root->left == NULL && root->right ==NULL)
return 1;
return leafnum(root->left)+leafnum(root->right);
}
2,第K层节点个数</
1,求叶子节点个数
int leafnum(Node* root)
{
if(root == NULL)
return 0;
if(root->left == NULL && root->right ==NULL)
return 1;
return leafnum(root->left)+leafnum(root->right);
}
2,第K层节点个数</