python实现简单二叉树 及层序遍历

class TreeNode:
def _init_(self,data,lchild,rchild):
self.data=data
self.lchild=lchild
self.rchild=rchild

class BinaryTree:
def _init_(self):
self.root=None
def makeTree(self,data,lchild,rchild):
self.root=TreeNode(data,lchild,rchild)
def isEmpty(self):
if self.root==None:
print("Tree is empty")
else :
print("Tree is not empty")
return false
def leveOrederprint(self,a):
r=a
q=Queue.Queue()
while r is not None:
print(r.root.data)
if r.root.lchild is not None:
q.put(r.root.lchild)
if r.root.rchild is not None:
q.put(r.root.rchild)
if q.empty():
print("end")
r=None
else:
r=q.get()

仅仅写了中序遍历