树的应用举例

二叉树

'''


'''


#先序遍历  【这里指根在先】
from collections import deque

class BitTree():
    def __init__(self):
        self.root=None
    def insert(self,node,pos):
        pass
    @staticmethod
    def pre_order(BitTreeNode):
        if BitTreeNode:
            print(BitTreeNode.data,end="")
            BitTree.pre_order(BitTreeNode.lchild)
            BitTree.pre_order(BitTreeNode.rchild)


    @staticmethod
    def in_order(BitTreeNode):#这个方法基于node
        if BitTreeNode:
            BitTree.pre_order(BitTreeNode.lchild)
            print(BitTreeNode.data, end="")

            BitTree.pre_order(BitTreeNode.rchild)

    @staticmethod
    def post_order(BitTreeNode):
            if BitTreeNode:
                BitTree.post_order(BitTreeNode.lchild)
                BitTree.post_order(BitTreeNode.rchild)
                print(BitTreeNode.data, end="")
    @staticmethod