[leetcode]94. Binary Tree Inorder Traversal

94. Binary Tree Inorder Traversal

 

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

Example:

Input: [1,null,2,3]

    1 

      \

        2

     /

 3

Output: [1,3,2]

 

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