二叉树排序

#!usr/bin/python
# -*- coding: utf-8 -*-
class Node:
    def __init__(self, value=None, left=None, right=None):
        self.value = value
        self.left = left
        self.right = right


def preTraverse(root):
    '''
    前序遍历,根左右
    '''
    if root == None:
        return
    print(root.value)
    preTraverse(root.left)
    preTraverse(root.right)


def midTraverse(root):
    '''
    中序遍历，左根右
    '''
    if root == None:
        return
    midTraverse(root.left)
    print(root.value)
    midTraverse(root.right)


def afterTraverse(root):
    '''
    后序遍历 左右根
    '''
    if root == None:
        return
    afterTraverse(root.left)
    afterTraverse(root.right)
    print(root.value)


# 已知前序和中序遍历，求后序遍历
# 思路，每次找出
preList = list('12473568')
midList = list('47215386')
afterList = []


def findTree(preList, midList, afterList):
    if len(preList) == 0:
        return
    if len(preList) == 1:
        afterList.append(preList[0])
        return
    root = preList[0]
    n = midList.index(root)
    findTree(preList[1:n + 1], midList[:n], afterList)
    findTree(preList[n + 1:], midList[n + 1:], afterList)
    afterList.append(root)


# 二叉树的最大深度
# 基本思路就是递归，当前树的最大深度等于（1+max(左子树最大深度，右子树最大深度)）
def maxDepth(root):
    if not root:
        return 0
    return 1 + max(maxDepth(root.left), maxDepth(root.right))


# 根节点到叶子节点的所有路径
def traverse(node):
    if not node.left and not node.right:
        return [str(node.value)]
    left, right = [], []
    if node.left:
        left = [str(node.value) + x for x in traverse(node.left)]
    if node.right:
        right = [str(node.value) + x for x in traverse(node.right)]

    return left + right


if __name__ == '__main__':
    root = Node('A', Node('B', Node('D'), Node('E')), Node('C', right=Node('F', Node('G'))))
    print('前序遍历：')
    preTraverse(root)
    print('\n')
    print('中序遍历：')
    midTraverse(root)
    print('\n')
    print('后序遍历：')
    afterTraverse(root)
    print('\n')
    print("后序遍历结果是：")
    print(afterList)
    findTree(preList, midList, afterList)
    print(traverse(root))