class Solution(object):
def inorderTraversal(self, root):
"""
:type root: TreeNode
:rtype: List[int]
"""
ret=[]
if root==None:
return ret
ret.extend(self.inorderTraversal(root.left))
ret.append(root.val)
ret.extend(self.inorderTraversal(root.right))
return ret