forked from UNN/2026-rff_mp
66 lines
1.9 KiB
Python
66 lines
1.9 KiB
Python
# Двоичное дерево поиска (не сбалансированное)
|
|
|
|
def create_node(name, phone):
|
|
return {'name': name, 'phone': phone, 'left': None, 'right': None}
|
|
|
|
def bst_insert(root, name, phone):
|
|
if root is None:
|
|
return create_node(name, phone)
|
|
|
|
if name == root['name']:
|
|
root['phone'] = phone
|
|
elif name < root['name']:
|
|
root['left'] = bst_insert(root['left'], name, phone)
|
|
else:
|
|
root['right'] = bst_insert(root['right'], name, phone)
|
|
return root
|
|
|
|
def bst_find(root, name):
|
|
if root is None:
|
|
return None
|
|
if name == root['name']:
|
|
return root['phone']
|
|
elif name < root['name']:
|
|
return bst_find(root['left'], name)
|
|
else:
|
|
return bst_find(root['right'], name)
|
|
|
|
def _find_min(node):
|
|
while node['left'] is not None:
|
|
node = node['left']
|
|
return node
|
|
|
|
def bst_delete(root, name):
|
|
if root is None:
|
|
return None
|
|
|
|
if name < root['name']:
|
|
root['left'] = bst_delete(root['left'], name)
|
|
elif name > root['name']:
|
|
root['right'] = bst_delete(root['right'], name)
|
|
else:
|
|
# Нашли узел, который нужно удалить
|
|
if root['left'] is None:
|
|
return root['right']
|
|
if root['right'] is None:
|
|
return root['left']
|
|
|
|
# Узел имеет двух потомков: заменяем наименьшим из правого поддерева
|
|
min_node = _find_min(root['right'])
|
|
root['name'] = min_node['name']
|
|
root['phone'] = min_node['phone']
|
|
root['right'] = bst_delete(root['right'], min_node['name'])
|
|
return root
|
|
|
|
def bst_list_all(root):
|
|
result = []
|
|
|
|
def inorder(node):
|
|
if node is None:
|
|
return
|
|
inorder(node['left'])
|
|
result.append((node['name'], node['phone']))
|
|
inorder(node['right'])
|
|
|
|
inorder(root)
|
|
return result |