C++实现二叉树左右子树交换算法

C++实现二叉树左右子树交换算法-CSDN博客

struct TreeNode {
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
};
 
void swapLeftRight(TreeNode* node) {
    if (node == nullptr) return;
    TreeNode* temp = node->left;
    node->left = node->right;
    node->right = temp;
    swapLeftRight(node->left);
    swapLeftRight(node->right);
}