题目描述
操作给定的二叉树,将其变换为源二叉树的镜像。
输入描述:
二叉树的镜像定义:源二叉树
8
/ \
6 10
/ \ / \
5 7 9 11
镜像二叉树
8
/ \
10 6
/ \ / \
11 9 7 5
思路:
前序遍历,每次交换节点的左右子树;即必须先交换节点的左右子树后,才能继续遍历。
参考答案:
# -*- coding:utf-8 -*-
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
# 返回镜像树的根节点
def Mirror(self, root):
# write code here
if not root:
return
root.left, root.right = root.right, root.left
self.Mirror(root.left)
self.Mirror(root.right)
C++ Version:
/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};*/
class Solution {
public:
void Mirror(TreeNode *pRoot) {
if (pRoot == NULL){
return;
}
TreeNode * node = pRoot->left;
pRoot->left = pRoot->right;
pRoot->right = node;
Mirror(pRoot->left);
Mirror(pRoot->right);
}
};
Note
- 注意运用这种递归思路!