Simple Python Recursive with less space

interview-questions
amazon
Tags: #<Tag:0x00007f2428a94ba8> #<Tag:0x00007f2428a94a68>

#1
class Solution:
	# @param A : root node of tree
	# @return a list of integers
	def __init__(self):
	    self.values = []
	def inorderTraversal(self, A):
	    if A is None:
	        return None
	    self.inorderTraversal(A.left)
	    if A is not None:
    	    self.values.append(A.val)
	    self.inorderTraversal(A.right)
	    return self.values