018二叉树的镜像(树)
题目描述
操作给定的二叉树,将其变换为源二叉树的镜像。
解题思路
直接交换左右子树
C++代码实现
C++ clang++3.9
/*
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 *mid=pRoot->left;
pRoot->left=pRoot->right;
pRoot->right=mid;
Mirror(pRoot->left);
Mirror(pRoot->right);
}
};
运行时间:2ms
占用内存:360k
python代码实现
python 2.7.3
# -*- 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 root==None: return
mid=root.left
root.left=root.right
root.right=mid
self.Mirror(root.left)
self.Mirror(root.right)
运行时间:23ms
占用内存:5728k