Python
# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution(object):
def inorderTraversal(self, root):
"""
:type root: TreeNode
:rtype: List[int]
"""
l = []
self.visitNode(root, l)
return l
def visitNode(self, root, l):
if root is None:
return
self.visitNode(root.left, l)
l.append(root.val)
self.visitNode(root.right, l)