《剑指offer》27-- 二叉树的镜像[C++]

NowCoder  LeetCode

题目描述

操作给定的二叉树，将其变换为源二叉树的镜像。

struct TreeNode {
	int val;
	struct TreeNode *left;
	struct TreeNode *right;
	TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};

输入描述:

二叉树的镜像定义：源二叉树 
    	    8
    	   /  \
    	  6   10
    	 / \  / \
    	5  7 9 11
    	镜像二叉树
    	    8
    	   /  \
    	  10   6
    	 / \  / \
    	11 9 7  5

解题思路

class Solution {
public:
    void Mirror(TreeNode *pRoot) {
        if(!pRoot) return;
        auto temp = pRoot->left;
        pRoot->left = pRoot->right;
        pRoot->right = temp;
        Mirror(pRoot->left);
        Mirror(pRoot->right);
    }
};

leetcode 226 答案

方法一

class Solution {
public:
    TreeNode* invertTree(TreeNode* root) {
        if(root) {
            auto temp = root->left;
            root->left = root->right;
            root->right = temp;
            invertTree(root->left);
            invertTree(root->right);
        }
        return root;
    }
};

方法二

class Solution {
public:
    TreeNode* invertTree(TreeNode* root) {
        if(root) {
            auto left = root->left;  // 后面的操作会改变 left 指针，因此先保存下来
            root->left = invertTree(root->right);
            root->right = invertTree(left);
        }
        return root;
    }
};