剑指 Offer 27. 二叉树的镜像
说明
请完成一个函数,输入一个二叉树,该函数输出它的镜像。
例如输入:
4
/ \
2 7
/ \ / \
1 3 6 9
镜像输出:
4
/ \
7 2
/ \ / \
9 6 3 1
示例
输入:root = [4,2,7,1,3,6,9]
输出:[4,7,2,9,6,3,1]
题解思路
1、递归交换左右节点
2、利用栈辅助,当前节点存在左右子节点,将该节点的左右子节点存入栈中,然后交换左右子节点
代码实现
1、递归
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def mirrorTree(self, root: TreeNode) -> TreeNode:
def dfs(root):
if not root:
return None
tmp = root.left
root.left = root.right
root.right = tmp
dfs(root.left)
dfs(root.right)
dfs(root)
return root
2、栈辅助
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def mirrorTree(self, root: TreeNode) -> TreeNode:
if not root:
return None
tmp = [root]
while tmp:
node = tmp.pop()
if node.left:
tmp.append(node.left)
if node.right:
tmp.append(node.right)
node.left, node.right = node.right, node.left
return root