sortlist=[4,72,81,6,73,124,65,68,66]
class Node(object):
def __init__(self,value):
self.left=None
self.right=None
self.value=value
self.p=None
def buidtree(tree): # 返回树的非空节点个数
if tree==None:
return 0
elif tree.left==None and tree.right==None:
return 1
return buidtree(tree.left)+buidtree(tree.right)+1
def createTree(tree,value): # 创建树
if tree.left==None:
tree.left=Node(value)
tree.left.p=tree
return
elif tree.right==None:
tree.right=Node(value)
tree.right.p=tree
return
if buidtree(tree.left)-buidtree(tree.right)*2==1: # 判断加入左还是右
createTree(tree.right,value)
else:
createTree(tree