给定一个二叉树,返回它的中序 遍历。
示例:
输入: [1,null,2,3] 1 \ 2 / 3 输出: [1,3,2]
思路:
递归就完事了,先处理左子树,再处理root,再处理右子树。
# 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]
"""
result = list()
self.generate(root, result)
return result
def generate(self, root, result):
if not root:
return
if root.left:
self.generate(root.left, result)
result.append(root.val)
if root.right:
self.generate(root.right, result)