From 319171fe2c8d55289a5f6a53506fddcdfb8668c0 Mon Sep 17 00:00:00 2001
From: semyanovra <ruslansemyanov20@gmail.com>
Date: Sun, 24 May 2026 21:14:28 +0000
Subject: [PATCH] [1] implement binary search tree

---
 semyanovra/docs/data/1-st/main.py | 84 ++++++++++++++++++++++++++++---
 1 file changed, 76 insertions(+), 8 deletions(-)

diff --git a/semyanovra/docs/data/1-st/main.py b/semyanovra/docs/data/1-st/main.py
index ca0d9b5..072a213 100644
--- a/semyanovra/docs/data/1-st/main.py
+++ b/semyanovra/docs/data/1-st/main.py
@@ -80,22 +80,90 @@ def ht_list_all(table):
     return all_records
 
 
+def bst_create_node(name, phone):
+    return {'name': name, 'phone': phone, 'left': None, 'right': None}
+
+def bst_insert(root, name, phone):
+    if root is None:
+        return bst_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 bst_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 = bst_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_traverse(node):
+        if node is None:
+            return
+        inorder_traverse(node['left'])
+        result.append((node['name'], node['phone']))
+        inorder_traverse(node['right'])
+
+    inorder_traverse(root)
+    return result
+
+
 if __name__ == "__main__":
     print("=== Тестирование связного списка ===")
     head = None
     head = ll_insert(head, "Ivan", "123-456")
     head = ll_insert(head, "Boris", "789-012")
-    head = ll_insert(head, "Anna", "345-678")
-    head = ll_insert(head, "Ivan", "111-222")
     print("LinkedList:", ll_list_all(head))
 
     print("\n=== Тестирование хеш-таблицы ===")
     ht = ht_create()
     ht = ht_insert(ht, "Ivan", "123-456")
     ht = ht_insert(ht, "Boris", "789-012")
-    ht = ht_insert(ht, "Anna", "345-678")
-    ht = ht_insert(ht, "Ivan", "111-222")
-    print("HashTable entries:", ht_list_all(ht))
-    print("Find Ivan:", ht_find(ht, "Ivan"))
-    ht = ht_delete(ht, "Boris")
-    print("After delete Boris:", ht_list_all(ht))
\ No newline at end of file
+    print("HashTable:", ht_list_all(ht))
+
+    print("\n=== Тестирование BST ===")
+    bst_root = None
+    bst_root = bst_insert(bst_root, "Ivan", "123-456")
+    bst_root = bst_insert(bst_root, "Boris", "789-012")
+    bst_root = bst_insert(bst_root, "Anna", "345-678")
+    bst_root = bst_insert(bst_root, "Ivan", "111-222")
+    print("BST entries:", bst_list_all(bst_root))
+    print("Find Ivan:", bst_find(bst_root, "Ivan"))
+    bst_root = bst_delete(bst_root, "Boris")
+    print("After delete Boris:", bst_list_all(bst_root))
\ No newline at end of file