面试 27 题:
题目: 二叉树的镜像
题: 操作给定的二叉树, 将其变换为源二叉树的镜像.
输入描述:
二叉树的镜像定义: 源二叉树
- 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
- if not root.left and not root.right:
- return
- pTemp=root.left
- root.left=root.right
- root.right=pTemp
- if root.left:
- self.Mirror(root.left)
- if root.right:
- self.Mirror(root.right)
来源: http://www.bubuko.com/infodetail-2651049.html