# 1. СВЯЗНЫЙ СПИСОК
def ll_create_node(name, phone):
    return {'name': name, 'phone': phone, 'next': None}


def ll_insert(head, name, phone):
    """Добавить или обновить запись. Возвращает голову списка."""
    node = head
    while node is not None:
        if node['name'] == name:
            node['phone'] = phone   # обновить
            return head
        node = node['next']
    # Вставка в начало — O(1)
    new_node = ll_create_node(name, phone)
    new_node['next'] = head
    return new_node


def ll_find(head, name):
    """Вернуть телефон или None."""
    node = head
    while node is not None:
        if node['name'] == name:
            return node['phone']
        node = node['next']
    return None


def ll_delete(head, name):
    """Удалить узел, вернуть новую голову."""
    if head is None:
        return None
    if head['name'] == name:
        return head['next']
    prev, node = head, head['next']
    while node is not None:
        if node['name'] == name:
            prev['next'] = node['next']
            return head
        prev, node = node, node['next']
    return head


def ll_list_all(head):
    """Собрать все записи и вернуть отсортированный список (name, phone)."""
    result = []
    node = head
    while node is not None:
        result.append((node['name'], node['phone']))
        node = node['next']
    result.sort(key=lambda x: x[0])
    return result

# 2. ХЕШ-ТАБЛИЦА (цепочки через связный список)

HT_SIZE = 1024   # число корзин (степень двойки)


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


def _ht_hash(name, size):
    h = 5381
    for ch in name:
        h = ((h << 5) + h) ^ ord(ch)
    return h % size


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


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


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


def ht_list_all(buckets):
    result = []
    for head in buckets:
        result.extend(ll_list_all(head))
    result.sort(key=lambda x: x[0])
    return result

# 3. ДВОИЧНОЕ ДЕРЕВО ПОИСКА (BST)

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):
    """Вернуть телефон или None."""
    while root is not None:
        if name == root['name']:
            return root['phone']
        elif name < root['name']:
            root = root['left']
        else:
            root = root['right']
    return None


def _bst_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']
        # Два потомка: заменить минимальным из правого поддерева
        successor = _bst_min(root['right'])
        root['name'] = successor['name']
        root['phone'] = successor['phone']
        root['right'] = bst_delete(root['right'], successor['name'])
    return root


def bst_list_all(root):
    """Центрированный (in-order) обход → отсортированный список."""
    result = []
    stack = []
    node = root
    while stack or node is not None:
        while node is not None:
            stack.append(node)
            node = node['left']
        node = stack.pop()
        result.append((node['name'], node['phone']))
        node = node['right']
    return result