python实现基本二叉树结构，实现层序遍历

binary Tree

# define a node
class Node:
	def __init__(self,data):
		self.data = data
		self.left = None
		self.right = None
class BinTree:
	def __init__(self):
		self.root = None
		self.left = None
		self.right = None
		self.ls = [] # use the new node to add it's child node
	def add(self,data):
		data = Node(data)
		if not self.root:
			self.root = data
			self.ls.append(data)
		else:
			temproot = self.ls[0] # the temporary "root" node
			if not temproot.left:
				temproot.left = data
				self.ls.append(data)
			if not temproot.right:
				temproot.right = data
				self.ls.append(data)
				self.ls.pop(0) # after add the left and right node, delete the parent node
	def out_levelorder(self):
		if not self.root:
			print("This tree is none")
			return 
		level = [self.root]
		while(len(level)!=0): # level order 
			lenth = len(level):
			while lenth>0: # one level
				print(level[0].data)
				if level[0].left:
					level.append(level[0].left)
				if level[0].right:
					level.append(level[0].right)
				level.pop(0)
				lenth-=1
if __name__ == "__main__":
    tree = BinTree()
    for i in range(11):
        tree.add(i)
    tree.out_value_levelorder()