class BinaryTree:
def __init__(self,key,val = None, left = None,right = None,parent = None):
self.key = key
self.val = val
self.left = left
self.right = right
self.parent = parent
def buildTree(lst):
nodelst = [BinaryTree(i) for i in lst]
eTree = nodelst[0]
currentTree = eTree
def _Tree(currentTree,i):
if lst[i] < currentTr
慕课《数据结构与算法分析python版》期末
最新推荐文章于 2022-12-04 11:54:07 发布