方法1
recursive traverse
Time complexity: O(n)
Space complexity: O(n)
class Solution:
def inorderTraversal(self, root: TreeNode) -> List[int]:
res = []
self.dfs(root, res)
return res
def dfs(self, root, res):
if not root:
return
self.dfs(root.left, res)
res.append(root.val)
self