leetcode_gym/_problems/invertTree.md

layout, title, last_solved, category, leetcode_url, status

layout	title	last_solved	category	leetcode_url	status
page	invert Tree	2020-06-01	tree	https://leetcode.com/problems/invert-binary-tree/	Solved

{% highlight python %}

class TreeNode:

def __init__(self, val):

    self.val = val
    self.left = None
    self.right = None

def invert(root):

if not root:
    return

tmp = root.left
root.left = root.right
root.right = tmp

invert(root.left)
invert(root.right)

root = TreeNode(1) root.left = TreeNode(2) root.right = TreeNode(3) root.left.left = TreeNode(4) root.right.right = TreeNode(5)

print( root.left.left.val ) # 4

{% endhighlight %}