用python写的一个简单二叉树排序类
摘要:
#coding:utf-8max_val = [99999999,-99999999]class Mysort(object): "Mysort to sort a int array" def __init__(self,List): self.mylist = List self.bs = '' self.Dict ={0:min,1:max} self.select = '' def buildTree(self,rt,L,R):#树一棵二叉树,每个节点维护当前子树的最小值(最大值) ... 阅读全文
posted @ 2013-03-08 22:46 aigoruan 阅读(628) 评论(1) 推荐(0)
浙公网安备 33010602011771号