Question

"""
Add_to_front(self, val) and add_to_back(self, val) functions can be used which are already done in python class. Name of list is LList

class node(object):

    def __init__(self, data, next=None):

        self.data = data
        self.next = next

    # Note: use the attributes directly; no setters or getters!

class LList(object):
    def __init__(self):

        self._size = 0     
        self._head = None  
        self._tail = None

"""
def set_data_at_index(self, idx, val):
    """
        The value stored at index idx changes to val
        return True if the index was valid otherwise return False
    """



def insert_value_at_index(self, val, idx):
    """
        The list increases in size.
        The new value is at index idx.
        The values previously in the list at idx or later appear after the new value.
        return If the index is valid, insert_value_at_index returns True.
        return If the index is not valid, insert_value_at_index returns False.
    """


def delete_item_at_index(self, idx):
    """
    
        The list decreases in size if the index is valid
        The value at idx is no longer in the list.
        return True if index was valid otherwise return False
    """

Answer 1

Code:

class node(object):
    def __init__(self, data, next=None):
        self.data = data
        self.next = next
    # Note: use the attributes directly; no setters or getters!
class LList(object):
    def __init__(self):
        self._size = 0 
        self._head = None 
        self._tail = None 
    def set_data_at_index(self, idx, val):
    """
        The value stored at index idx changes to val
        return True if the index was valid otherwise return False
    """
        if not 0<=id<self._size:
            return False
        itr = self._head
        for i in range(idx):
            itr = itr.next
        itr.data = val
        return True
    def insert_value_at_index(self, val, idx):
    """
        The list increases in size.
        The new value is at index idx.
        The values previously in the list at idx or later appear after the new value.
        return If the index is valid, insert_value_at_index returns True.
        return If the index is not valid, insert_value_at_index returns False.
    """
        if not 0<=idx<self._size:
            return False
        if idx==0:
            tmp = self._head
            self._head = node(val, tmp)
            self._size += 1
            return True
        itr = self._head
        for i in range(idx-1):
            itr = itr.next
        tmp = node(val, itr.next)
        itr.next = tmp
        self._size += 1
        return True
    def delete_item_at_index(self, idx):
    """
    
        The list decreases in size if the index is valid
        The value at idx is no longer in the list.
        return True if index was valid otherwise return False
    """
        if not 0<=idx<self._size:
            return False
        if idx==0:
            tmp = self._head
            self._head = tmp.next
            del tmp
            self._size -= 1
            return True
        itr = self._head
        for i in range(idx-1):
            itr = itr.next
        tmp = itr.next
        itr.next = tmp.next
        del tmp
        if idx == self._size - 1:
            self._last = itr
        self._size -= 1
        return True

Code Screenshot:

2 3 4 5 6 Eclass node (object): def init (self, data, next=None): self. data = data self.next = next # Note: use the attributes directly; no setters or getters! class LList (object): def init (self): self. size = 0 self. head = None self. tail = None def set_data_at_index (self, idx, val): 7 = The value stored at index indx changes to val return True if the index was valid otherwise return False if not 0<=id self._size: return false itr = self._head for i in range (idx): itr = itr.next itr.data = val return True def insert_value_at_index (self, val, idx): 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 The list increases in size. The new value is at index idx- The values previously in the list at idx or later appear after the new value. return If the index is valid, insert value at index returns True. return If the index is not valid, insert_value_at_index returns False. H日下中 if not 0<=idx<self._size: return false if idx==0: tmp = self._head self._head = node (val, tmp) self. size += 1 return True itr = self. head for i in range (idx-1): itr = itr.next tmp = node (val, itr.next) itr.next = tmp self._size += 1 return True

def delete_item_at_index (self, idx): The list decreases in size if the index is valid The value at idx is no longer in the list. return True if index was valid otherwise return false 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 if not 0<=idx<self._size: return false if idx==(: tmp = self._head self._head = tmp.next del tmp self._size -= 1 return True itr = self. head for i in range (idx-1): itr = itr.next tmp = itr.next itr.next = tmp.next del tmp if idx == self._size - 1: self._last = itr self. size -= 1 return True

Since you have asked only for the code, written it.

Thank you! Hit like if you like my work.