Linked List[insert, search]

myLinkedlist = [27, 19, 36, 42, 16, None, None, None, None, None, None, None]
myLinkedPointer = [-1, 0, 1, 2, 3, 6, 7, 8, 9, 10, 11, -1]
startPointer = 4
heapStartPointer = 5


def insert(value):
    global startPointer, heapStartPointer
    if heapStartPointer != -1:
        myLinkedlist[heapStartPointer] = value
        buffer = myLinkedPointer[heapStartPointer]
        myLinkedPointer[heapStartPointer] = startPointer
        startPointer = heapStartPointer
        heapStartPointer = buffer
        print(myLinkedlist)
    else:
        print('full')


def search(value):
    global startPointer, heapStartPointer
    found = False
    while not found and myLinkedPointer[startPointer] != -1:
        if myLinkedlist[startPointer] == value:
            print('found')
            found = True
        else:
            startPointer = myLinkedPointer[startPointer]
    if not found:
        print('not found')



insert('ic')
insert(8)
search('ic3')

Output:

[27, 19, 36, 42, 16, 'ic', None, None, None, None, None, None]
[27, 19, 36, 42, 16, 'ic', 8, None, None, None, None, None]
not found