MCPcopy Create free account
hub / github.com/Jack-Lee-Hiter/AlgorithmsByPython / invertTree

Method invertTree

leetcode/226. Invert Binary Tree.py:26–32  ·  view source on GitHub ↗
(self, root)

Source from the content-addressed store, hash-verified

24
25class Solution(object):
26 def invertTree(self, root):
27 if not root:
28 return
29 if not root.left and not root.right:
30 return root
31 root.left, root.right = self.invertTree(root.right), self.invertTree(root.left)
32 return root
33
34 def invertTree2(self, root):
35 if root:

Callers 1

invertTree2Method · 0.95

Calls

no outgoing calls

Tested by

no test coverage detected