leetcode 226.翻转二叉树

一碰到递归就抓瞎# Definition for a binary tree node. # class TreeNode: # def __init__(self, val0, leftNone, rightNone): # self.val val # self.left left # self.right right class Solution: def invertTree(self, root: Optional[TreeNode]) - Optional[TreeNode]: if not root: return None self.invertTree(root.left) self.invertTree(root.right) root.left,root.right root.right,root.left return root