我希望我做对了;)
我建议不要为Tree_Node而烦恼,只需像这样继续BSearch_Tree:import pprint
class BSearch_tree():
def __init__(self, key=None, val=None, root=None):
self.root = root
self.key = key
self.val = val
self.left = None
self.right = None
def insert(self, key, val):
if self.key is None:
self.root = self
self.key = key
self.val = val
elif key == self.key:
self.val=val
elif key < self.key:
if self.left == None:
self.left=BSearch_tree(key,val,self.root)
self.left.insert(key,val)
elif key > self.key:
if self.right == None:
self.right=BSearch_tree(key,val,self.root)
self.right.insert(key,val)
# return self
def __repr__(self):
return '' % self.key, self.val, self.left, self.right)
# lazy retreaval with recursion
def __getitem__(self, key):
if self.key is None:
raise KeyError
elif key == self.key:
return self.val
elif key < self.key:
if self.left == None:
raise KeyError
return self.left[key]
elif key > self.key:
if self.right == None:
raise KeyError
return self.right[key]
bt = BSearch_tree()
bt.insert(1,'1')
print bt[1]
bt.insert(2,'2')
print bt[2]
try:
print bt[3]
except KeyError:
print '3 not there as expected'
bt.insert(5,'5')
print bt[5]
bt.insert(3,'3')
print bt[3]
pprint.pprint(bt)
我觉得我应该在某处使用self.root,但我现在还不完全确定。在