struct TreeNode{
int data;
struct TreeNode *left, *right;
};
int fnGetLeaf( TreeNode *T )
{
if(T==NULL) return 0;
if( T->left!=NULL && T->right!=NULL)
return (1+fnGetLeaf(T->left)+ fnGetLeaf(T->left));
else return(fnGetLeaf(T->left)+ fnGetLeaf(T->left));
}
求二叉树双支个数的算法
最新推荐文章于 2022-10-26 15:19:47 发布