题目:
给定一个整型数组arr,已知其中没有重复值,判断arr是否可能是节点值类型为整型的搜索二叉树后续遍历的结果
思路:根据搜索二叉树的性质,比后续数组最后一个元素值小的数组会在数组的左边,比数组最后一个元素值大的数组会在数组的右边。
def isPostArray(arr):
if arr == None or len(arr)==0:
return False
return isPost(arr,0,len(arr)-1)
def isPost(arr,start,end):
if start == end:
return True
less = -1
more = end
for i in range(start,end):
if arr[i] < arr[end]:
less = i
else:
if end == more:
more = i + 1
if less == -1 or more == end:
return isPost(arr,start,end-1)
if less!=more-1:
return False
return isPost(arr,start,less) and isPost(arr,less+1,end-1)
可参考例子: arr = [2,1,3,6,5,7,4] 4 <4 = [2,1,3] >4 = [6,5,7]
进阶问题:如果整型数组arr中没有重复值,且已知是一颗搜索二叉树的后续遍历结果,通过数组arr重构二叉树。
class Node:
def __init__(self,value):
self.value = value
self.left = None
self.right = None
def ArrayToBST(array):
if array == None or len(array)==0:
return None
return ToBST(arr,0,len(array)-1)
def ToBST(arr,start,end):
if start > end:
return None
node = Node(arr[end])
less = -1
more = end
for i in range(start,end):
if arr[end] > arr[i]:
less = i
else:
if more == end:
more = i
node.left = ToBST(arr,start,less)
node.right = ToBST(arr,more,end-1)
return node