python16_day35【算法】

一、BTree

 class BinTreeNode:
     def __init__(self, data):
         self.data = data
         self.lchild = None
         self.rchild = None

 k = BinTreeNode('K')
 g = BinTreeNode('G')
 c = BinTreeNode('C')
 a = BinTreeNode('A')
 b = BinTreeNode('B')
 d = BinTreeNode('D')
 e = BinTreeNode('E')
 f = BinTreeNode('F')
 h = BinTreeNode('H')

 root = a
 a.lchild = b
 a.rchild = e
 b.lchild = h
 b.rchild = f
 f.lchild = d
 e.rchild = c
 c.lchild = k
 c.rchild = g

 #前序遍历 中序遍历 后序遍历

 def PreBianli(root):
     p = root
     if p:
         print(p.data, end=' ')
         PreBianli(p.lchild)
         PreBianli(p.rchild)

 def MidBianli(root):
     p = root
     if p:
         MidBianli(p.lchild)
         print(p.data, end=' ')
         MidBianli(p.rchild)

 def PostBianli(root):
     p = root
     if p:
         PostBianli(p.lchild)
         PostBianli(p.rchild)
         print(p.data, end=' ')

 def LevelBianli(root):
     curLevel = [root]
     nextLevel = []
     while len(curLevel)>0:
         for node in curLevel:
             print(node.data, end=' ')
             if node.lchild:
                 nextLevel.append(node.lchild)
             if node.rchild:
                 nextLevel.append(node.rchild)
         curLevel = nextLevel
         nextLevel = []

 # PreBianli(root)
 # print()
 # MidBianli(root)
 # print()
 # PostBianli(root)
 LevelBianli(root)