题目描述:
Invert a binary tree.
4
/ \
2 7
/ \ / \
1 3 6 9
to
4
/ \
7 2
/ \ / \
9 6 3 1
思路:
运用递归前序遍历二叉树来实现交换
AC代码:
class Solution(object):
def invertTree(self, root):
"""
:type root: TreeNode
:rtype: TreeNode
"""
def preOrder(root):
temp = root.left
root.left = root.right
root.right = temp
if root.left:
preOrder(root.left)
if root.right:
preOrder(root.right)
if not root:
return root
preOrder(root)
return root