python实现leetcode之94. 二叉树的中序遍历

解题思路

递归处理
先左子树
再根
然后右子树

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]
        """
        array = []
        h(root, array)
        return array


def h(root, array):
    if root:
        h(root.left, array)
        array.append(root.val)
        h(root.right, array)