py代码
# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution(object):
def mirror(self, root):
"""
:type root: TreeNode
:rtype: void
"""
self.jing(root)
def jing(self,node):
if node is None:
return
node.left,node.right=node.right,node.left
self.jing(node.left)
self.jing(node.right)