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

    new_node = {'name': name, 'phone': phone, 'next': head}
    return new_node

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['naext']['next']
            return head
        current = current['next']
    return head

def ll_list_all(head):
    records = []
    current = head

    while current is  not None:
        records.append((current['name'], current['phine']))
        current = current['next']
    records.sort(key=lambda x: x[0])
    return records

def hash_function(name, table_size):
    total = 0
    for ch in name:
        total = (total*31 + ord(ch)) % table_size
    return total

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

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

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)
    return buckets

def ht_list_all(buckets):
    records = []
    for bucket in buckets:
        current = bucket
        while current is not None:
            records.append((current['name'], current['phone']))
            current = current['next']
    records.sort(key=lambda x: x[0])
    return records

def bst_insert(root, name, phone):
    if root is None:
        return {'name': name, 'phone': phone, 'left': None, 'right': None}
    if name < root['name']:
        root['left'] = bst_insert(root['left'], name, phone)
    elif name > root['name']:
        root['right'] = bst_insert(root['right'], name, phone)
    else:
        root['phone'] = phone
    return root

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

def _bst_find_mine(node):
    current = node
    while current and current['left'] is not None:
        current = current['left']
    return current

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']
        elif root['right'] is None:
            return root['left']
        
        successor = _bst_find_mine(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):

    records = []

    def inorder(node):
        if node is  None:
            return
        inorder(node['left'])
        records.append((node['name'], node['phone']))
        inorder(node['right'])

    inorder(root)
    return records