import time
import random
import csv
import sys
import matplotlib.pyplot as plt
import numpy as np

sys.setrecursionlimit(20000)

REPEATS = 5
N = 10000
def ll_insert(head, name, phone):
    current = head
    prev = None
    while current is not None:
        if current['name'] == name:
            current['phone'] = phone
            return head
        prev = current
        current = current['next']
    new_node = {'name': name, 'phone': phone, 'next': None}
    if prev is None:
        return new_node
    else:
        prev['next'] = new_node
        return head

def ll_find(head, name):
    current = head
    while current is not None:
        if current['name'] == name:
            return current['phone']
        current = current['next']
    return None

def ll_delete(head, name):
    if head is None:
        return None
    if head['name'] == name:
        return head['next']
    current = head
    while current['next'] is not None:
        if current['next']['name'] == name:
            current['next'] = current['next']['next']
            return head
        current = current['next']
    return head

def ll_collect_all(head):
    records = []
    current = head
    while current is not None:
        records.append((current['name'], current['phone']))
        current = current['next']
    records.sort(key=lambda x: x[0])
    return records
def hash_function(name, size):
    total = 0
    for ch in name:
        total = (total * 31 + ord(ch)) % size
    return total

def ht_create(size=2000):
    return [None] * size

def ht_insert(buckets, name, phone):
    idx = hash_function(name, len(buckets))
    buckets[idx] = ll_insert(buckets[idx], name, phone)

def ht_find(buckets, name):
    idx = hash_function(name, len(buckets))
    return ll_find(buckets[idx], name)

def ht_delete(buckets, name):
    idx = hash_function(name, len(buckets))
    buckets[idx] = ll_delete(buckets[idx], name)

def ht_collect_all(buckets):
    all_records = []
    for bucket in buckets:
        current = bucket
        while current is not None:
            all_records.append((current['name'], current['phone']))
            current = current['next']
    all_records.sort(key=lambda x: x[0])
    return all_records
def bst_insert(root, name, phone):
    new_node = {'name': name, 'phone': phone, 'left': None, 'right': None}
    if root is None:
        return new_node
    current = root
    while True:
        if name < current['name']:
            if current['left'] is None:
                current['left'] = new_node
                break
            current = current['left']
        elif name > current['name']:
            if current['right'] is None:
                current['right'] = new_node
                break
            current = current['right']
        else:
            current['phone'] = phone
            break
    return root

def bst_find(root, name):
    current = root
    while current is not None:
        if name < current['name']:
            current = current['left']
        elif name > current['name']:
            current = current['right']
        else:
            return current['phone']
    return None

def bst_find_min(node):
    while node['left'] is not None:
        node = node['left']
    return node

def bst_delete(root, name):
    parent = None
    current = root
    while current is not None and current['name'] != name:
        parent = current
        if name < current['name']:
            current = current['left']
        else:
            current = current['right']
    if current is None:
        return root
    if current['left'] is None and current['right'] is None:
        if parent is None:
            return None
        if parent['left'] is current:
            parent['left'] = None
        else:
            parent['right'] = None
        return root
    if current['left'] is None:
        if parent is None:
            return current['right']
        if parent['left'] is current:
            parent['left'] = current['right']
        else:
            parent['right'] = current['right']
        return root
    if current['right'] is None:
        if parent is None:
            return current['left']
        if parent['left'] is current:
            parent['left'] = current['left']
        else:
            parent['right'] = current['left']
        return root
    succ_parent = current
    succ = current['right']
    while succ['left'] is not None:
        succ_parent = succ
        succ = succ['left']
    current['name'] = succ['name']
    current['phone'] = succ['phone']
    if succ_parent['left'] is succ:
        succ_parent['left'] = succ['right']
    else:
        succ_parent['right'] = succ['right']
    return root

def bst_inorder_collect(root, records=None):
    if records is None:
        records = []
    if root is not None:
        bst_inorder_collect(root['left'], records)
        records.append((root['name'], root['phone']))
        bst_inorder_collect(root['right'], records)
    return records