2019-04-28
阅读量:
628
如何用python语言实现一个二叉树?
class Tree():
def __init__(self,ltree = 0,rtree = 0,data = 0):
self.ltree = ltree
self.rtree = rtree
self.data = data
class BTree():
def __init__(self,base = 0):
self.base = base
def _Empty(self):
if self.base == 0:
return True
else:
return False
def qout(self,tree_base):
if tree_base == 0:
return
print tree_base.data
self.qout(tree_base.ltree)
self.qout(tree_base.rtree)
def mout(self,tree_base):
if tree_base == 0:
return
self.mout(tree_base.ltree)
print tree_base.data
self.mout(tree_base.rtree)
def hout(self,tree_base):
if tree_base == 0:
return
self.hout(tree_base.ltree)
self.hout(tree_base.rtree)
print tree_base.data






评论(0)


暂无数据
推荐帖子
2条评论
6条评论
7条评论