给一个二叉查找树(Binary Search Tree)的前序遍历结果数组,打印出所有的叶子节点。
tree=list(map(int,input().split())) #tree=[40, 31, 25, 20, 26, 33, 50, 42, 53] def findt(tree): if len(tree)<2: #return str(tree) return tree i=1 while (i<len(tree)) and tree[i]<=tree[0]: i+=1 if i==len(tree): return [tree[-1]] else: return findt(tree[1:i])+findt(tree[i:]) a=findt(tree) a=list(map(str,a)) #for i in a: # res+=' '+str(i) #print(res) print(' '.join(a))