题目:中序遍历二叉树
思路:递归
# 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 = []
return self._inorderTraversal(root,l)
def _inorderTraversal(self,root,l):
if root==None:return []
self._inorderTraversal(root.left,l)
l.append(root.val)
self._inorderTraversal(root.right,l)
return l