Python solution leetcode:226. Invert Binary Tree

Leetcode 226. Invert Binary Tree

Inverted binary tree

• Idea: Invert the left and right nodes separately, and then point the left and right pointers of the root node to the root node that is returned when the left-to-bottom side is inverted.

# Definition for a binary tree node.# class TreeNode (object):# def __init__ (self, x):# self.val = x# self.left = None# self.right = NoneclassSolution (Object):defInverttree ( Self, root):""": Type Root:treenode: Rtype:treenode        """        if  notRootreturn NoneLeft=  Self. Inverttree (Root.left) Right=  Self. Inverttree (Root.right) root.left=Right Root.right=LeftreturnRoot

The

Python solution leetcode:226. Invert Binary Tree