void sum(BiTree T,int &s)
{
while(T)
{
s=s+T->data;
sum(T->lchild,s);
sum(T->rchild,s);
}
}
统计二叉树各结点值的和
最新推荐文章于 2023-11-29 20:32:02 发布
void sum(BiTree T,int &s)
{
while(T)
{
s=s+T->data;
sum(T->lchild,s);
sum(T->rchild,s);
}
}