LeetCode Task22. 二叉树的中序遍历

题目

94. 二叉树的中序遍历

解答

代码

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution(object):
    def inorderTraversal(self, root):
        """
        :type root: TreeNode
        :rtype: List[int]
        """
        re = []
        def hs(root):
            if not root:
                return
            hs(root.left) 
            re.append(root.val) 
            hs(root.right)
        hs(root)
        return re

思路

递归

结果