[LeetCode] 94. Binary Tree Inorder Traversal

题目内容

https://leetcode-cn.com/problems/binary-tree-inorder-traversal/

Given a binary tree, return the inordertraversal of its nodes' values.

Example:

Input: [1,null,2,3]
   1
    \
     2
    /
   3

Output: [1,3,2]

给定一个二叉树，返回它的中序 遍历。

---

题目思路

这个就是基本的中序遍历算法。可以考虑放在一个函数里递归或者分成几个函数。

---

程序代码

# 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]
        """
        if not root:
            return []
        res=[]
        res+=self.inorderTraversal(root.left)
        res.append(root.val)
        res+=self.inorderTraversal(root.right)
        return res