NC45 实现二叉树先序，中序和后序遍历

题目描述

分别按照二叉树先序，中序和后序打印所有的节点。

示例1

输入

{1,2,3}

返回值

[[1,2,3],[2,1,3],[2,3,1]]

备注:

n≤106

Python代码：

# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

#
# 
# @param root TreeNode类 the root of binary tree
# @return int整型二维数组
#
class Solution:
    def threeOrders(self , root ):
        # write code here
        pre_order = []
        in_order = []
        post_order = []
        def helper(root):
            if not root:
                return []
            pre_order.append(root.val)
            helper(root.left)
            in_order.append(root.val)
            helper(root.right)
            post_order.append(root.val)
        helper(root)
        return [pre_order, in_order, post_order]