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

class Solution:
    # @param root, a tree node
    # @return a list of integers
    def inorder(self, root, solution):
        if root:
            self.inorder(root.left, solution)
            solution.append(root.val)
            self.inorder(root.right,solution)
    
    def inorderTraversal(self, root):
        solution = []
        self.inorder(root,solution)
        return solution



        
        
        
5d6b296651f3b0b4c9f19934bae1f6500c7f2d38
<mask token>

class Solution:
    <mask token>
    <mask token>

class Solution:
    <mask token>

    def inorderTraversal(self, root):
        solution = []
        self.inorder(root, solution)
        return solution

class Solution:

    def inorder(self, root, solution):
        if root:
            self.inorder(root.left, solution)
            solution.append(root.val)
            self.inorder(root.right, solution)

    def inorderTraversal(self, root):
        solution = []
        self.inorder(root, solution)
        return solution

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

class Solution:
    # @param root, a tree node
    # @return a list of integers
    def inorder(self, root, solution):
        if root:
            self.inorder(root.left, solution)
            solution.append(root.val)
            self.inorder(root.right,solution)
    
    def inorderTraversal(self, root):
        solution = []
        self.inorder(root,solution)
        return solution



        
        
        