94. Binary Tree Inorder Traversal刷题笔记

问题描述 中序遍历，用的是递归法，当然也可以用迭代法（栈）
代码

# 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]:
        result = []
        def inorder(node):
            if node:
                inorder(node.left)
                result.append(node.val)
                inorder(node.right)                
        inorder(root)
        return result

运行结果