"Leetcode" "Python" Binary Tree inorder traversal

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

For example:

Given binary Tree {1,#,2,3} ,

It is simpler to convert to a middle order traversal. The order of access is the middle sequence traversing the left subtree. root node, middle order traverse right subtree

When programming python, you need to be careful when you return a single number with the brackets "", or Python doesn't know it's a list

# Definition for a  binary tree node# class treenode:#     def __init__ (self, x): #         self.val = x#         self.left = No ne#         self.right = Noneclass solution:    # @param root, a tree node    # @return A list of integers    def inordertr Aversal (self, root):        If Root was none:            return []        elif Root.left is None and Root.right is none:            return [R Oot.val]        Else:            return self.inordertraversal (root.left) +[root.val]+self.inordertraversal (root.right)

"Leetcode" "Python" Binary Tree inorder traversal