1.问题描述:
给出一棵二叉树,返回其中序遍历。中根序遍历:先遍历左子树,然后遍历根结点,最后遍历右子树。
2.样例:
给出二叉树 {1,#,2,3}
,
1
\
2
/
3
返回 [1,3,2]
.
3.代码:
递归实现
"""
Definition of TreeNode:
class TreeNode:
def __init__(self, val):
self.val = val
self.left, self.right = None, None
"""
class Solution:
"""
@param: root: A Tree
@return: Inorder in ArrayList which contains node values.
"""
def __init__(self):
self.__A = []
def inorderTraversal(self, root):
# write your code here
if root is None:
return self.__A
lchild=root.left
rchild=root.right
self.inorderTraversal(lchild)
self.__A.append(root.val)
self.inorderTraversal(rchild)
return self.__A