class Node:
def __init__(self, info):
self.info = info
self.left = None
self.right = None
self.level = None
def __str__(self):
return str(self.info)
class BinarySearchTree:
def __init__(self):
self.root = None
def create(self, val):
if self.root == None:
self.root = Node(val)
else:
current = self.root
while True:
if val < current.info:
if current.left:
current = current.left
else:
current.left = Node(val)
break
elif val > current.info:
if current.right:
current = current.right
else:
current.right = Node(val)
break
else:
break
# Enter your code here. Read input from STDIN. Print output to STDOUT
'''
class Node:
def __init__(self,info):
self.info = info
self.left = None
self.right = None
// this is a node of the tree , which contains info as data, left , right
'''
def lca(root, v1, v2):
vmin=min(v1,v2)
vmax=max(v1,v2)
if vmin==root.info or vmax==root.info:
return root
if (vmin<root.info and vmax>root.info):
return root
elif vmax<root.info:
return lca(root.left,vmin,vmax)
else:
return lca(root.right,vmin,vmax)
tree = BinarySearchTree()
t = int(input())
arr = list(map(int, input().split()))
for i in range(t):
tree.create(arr[i])
v = list(map(int, input().split()))
ans = lca(tree.root, v[0], v[1])
print (ans.info)
Binary Search Tree : Lowest Common Ancestor
猜你喜欢
转载自blog.csdn.net/weixin_45405128/article/details/104230634
今日推荐
周排行