递归算法——交换二叉树的左右子树:
通过后续遍历实现:
完成遍历之后进行交换
void SwapsSubTree(BinaryTree *BT)
{
SwapsSubTree(BT->left);
SwapsSubTree(BT->right);
BinaryTree temp = BT->left;
BT->left = BT->right;
BT->right = temp;
}
递归算法——交换二叉树的左右子树:
通过后续遍历实现:
完成遍历之后进行交换
void SwapsSubTree(BinaryTree *BT)
{
SwapsSubTree(BT->left);
SwapsSubTree(BT->right);
BinaryTree temp = BT->left;
BT->left = BT->right;
BT->right = temp;
}