1.编写递归算法,将二叉树中所有结点的左、右子树相互交换。StatusExchangeBiTree(BiTree& T){ BiTree p; if(T){ p=T->lchild; T->lchild=T->rchild; T->rchild=p; ExchangeBiTree(T->lchild); } return OK;}
选项:
A:ExchangeBiTree(T);
B:ExchangeBiTree(T->lchild->rchild);
C:ExchangeBiTree(p);
D: ExchangeBiTree(T->rchild);
发布时间:2024-03-26 05:01:35