树的遍历方式

                                                  树的遍历方式

 

1、树图：

    

2、先（根）序遍历：

class BinTreeNode():
    def __init__(self, value, left=None, right=None):
        self.value, self.left, self.right = value, left, right


class BinTree():
    def __init__(self, root=None):
        self.root = root

    def preTraverse(self, root):
        """先（根）序遍历"""
        if root is None:
            return
        print(root.value)   # 递归处理根
        self.preTraverse(root.left)     # 递归处理左子树
        self.preTraverse(root.right)    # 递归处理右子树


if __name__ == "__main__":
    root = BinTreeNode("D",
                       BinTreeNode("B",
                                   BinTreeNode("A"), BinTreeNode("C")
                                   ),
                       BinTreeNode("E",
                                   BinTreeNode("F"),
                                   BinTreeNode("G", BinTreeNode("H"))
                                   )
                       )
    tree = BinTree()
    print("先（根）序遍历：")
    tree.preTraverse(root)

    先（根）序遍历：
    D
    B
    A
    C
    E
    F
    H
    G

3、中（根）序遍历：

class BinTreeNode():
    def __init__(self, value, left=None, right=None):
        self.value, self.left, self.right = value, left, right


class BinTree():
    def __init__(self, root=None):
        self.root = root

    def midTraverse(self, root):
        """中（根）序遍历"""
        if root is None:
            return
        self.midTraverse(root.left)  # 递归处理左子树
        print(root.value)  # 递归处理根
        self.midTraverse(root.right)  # 递归处理右子树


if __name__ == "__main__":
    root = BinTreeNode("D",
                       BinTreeNode("B",
                                   BinTreeNode("A"), BinTreeNode("C")
                                   ),
                       BinTreeNode("E",
                                   BinTreeNode("F"),
                                   BinTreeNode("G", BinTreeNode("H"))
                                   )
                       )
    tree = BinTree()
    print("中（根）序遍历：")
    tree.midTraverse(root)

    中（根）序遍历：
    A
    B
    C
    D
    H
    F
    E
    G

4、后（根）序遍历：

class BinTreeNode():
    def __init__(self, value, left=None, right=None):
        self.value, self.left, self.right = value, left, right


class BinTree():
    def __init__(self, root=None):
        self.root = root

    def afterTraverse(self, root):
        """后（根）序遍历"""
        if root is None:
            return
        self.afterTraverse(root.left)  # 递归处理左子树
        self.afterTraverse(root.right)  # 递归处理右子树
        print(root.value)  # 递归处理根


if __name__ == "__main__":
    root = BinTreeNode("D",
                       BinTreeNode("B",
                                   BinTreeNode("A"), BinTreeNode("C")
                                   ),
                       BinTreeNode("E",
                                   BinTreeNode("F"),
                                   BinTreeNode("G", BinTreeNode("H"))
                                   )
                       )
    tree = BinTree()
    print("后（根）序遍历：")
    tree.afterTraverse(root)

    后（根）序遍历：
    A
    C
    B
    H
    F
    G
    E
    D