leetcode--翻转二叉树
作者:互联网
翻转一棵二叉树。
示例:
输入:
4 / \ 2 7 / \ / \ 1 3 6 9
输出:
4 / \ 7 2 / \ / \ 9 6 3 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 invertTree(self, root: TreeNode) -> TreeNode: if root: root.left, root.right = root.right, root.left self.invertTree(root.left) self.invertTree(root.right) return root
执行用时 : 52 ms, 在Invert Binary Tree的Python3提交中击败了87.75% 的用户
内存消耗 : 13.1 MB, 在Invert Binary Tree的Python3提交中击败了65.41% 的用户
标签:right,TreeNode,invertTree,self,二叉树,left,root,leetcode,翻转 来源: https://blog.51cto.com/12080420/2389281