int GetLeafNum(TreeNode *root){
if(!root)
return 0;
else if(!root->left&&!root->right)
return 1;
else
return GetLeafNum(root->left)+GetLeafNum(root->right);
}
二叉树中叶子节点的个数
最新推荐文章于 2022-12-30 10:55:31 发布