使用二叉树排序
list = [19,283,0,-2,-3,89,76,3,5,9,19,879,627,-29,-987,-877,0,0,0]
rootNode = TNode(list[0])
bst = BSTSort(rootNode)
for i in range(1,len(list)):
tmpNode = TNode(list[i])
bst.addNode(tmpNode)#bst.printTree(rootNode)
list = []
bst.getSortList(rootNode, list)
print list
补充：移动开发 , 其他 ,
