4、二叉树的遍历

题目描述

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

# 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
        preorder, inorder, postorder = [], [], []
        def find(root):
            if not root:
                return None
            preorder.append(root.val)  # 先序
            find(root.left)
            inorder.append(root.val) # 中序
            find(root.right)
            postorder.append(root.val) # 后序
        find(root)
        return [preorder,inorder,postorder]     

避免了代码的重复