首页 > 代码库 > LeetCode(94)Binary Tree Inorder Traversal

LeetCode(94)Binary Tree Inorder Traversal

题目如下:

技术分享

Python代码:

    def inorderTraversal(self, root):
        res = []
        self.helper(root, res)
        return res
    
    def helper(self, root, res):
        if root:
            self.helper(root.left, res)
            res.append(root.val)
            self.helper(root.right, res)

 

LeetCode(94)Binary Tree Inorder Traversal