【hot100篇-python刷题记录】【二叉树的中序遍历】

R5-二叉树

思路：

递归实现--左中右

终止条件：结点为空

顺序：递归调用左子树，打印当前结点，递归调用右子树

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def inorderTraversal(self, root: Optional[TreeNode]) -> List[int]:
        ret=[]
        def dfs(root):
            if not root:
                return
            #打印顺序
            dfs(root.left)
            ret.append(root.val)
            dfs(root.right)
        dfs(root)
        return ret

ps:昨天被refused了，sad