题目描述
翻转一棵二叉树。
示例:
输入:
4
/ \
2 7
/ \ / \
1 3 6 9
输出:
合并后的树:
4
/ \
7 2
/ \ / \
9 6 3 1
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/invert-binary-tree/
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
解题方法和思路
递归翻转
思路和合并二叉树的思路非常相似,利用递归实现,要实现翻转功能可以分为一下几步:
- 该节点不空则进行一下步骤,否则返回None
- 翻转左子树
- 翻转右子树
- 交换左右孩子节点
核心代码:
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def invertTree(self, root: TreeNode) -> TreeNode:
if root is None:
return None
root.left ,root.right = self.invertTree(root.right), self.invertTree(root.left)
return root
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def invertTree(self, root: TreeNode) -> TreeNode:
if root is not None:
root.left ,root.right = self.invertTree(root.right), self.invertTree(root.left)
return root