Code: Alles auswählen

def get_node(self, k):
    
    
    node = self.head
    k += 1
    for level in reversed(range(self.max_lvl)):
        while node.widths[level] <= k:
            k -= node.widths[level]
            node = node.successors[level]
    return node

Code: Alles auswählen

def get_node(self, k):
    x = self.head
    pos = 0 
    for i in range(self.max_lvl, -1, -1):
        while pos + x.widths[i] < k:
            pos = pos + x.widths[i]
            x = x.successors[i]
    if x == None:
        return None
    else:
        return x 

Code: Alles auswählen

def get_node(self, i):
    r = self.head
    if r != None:
        for level in range(self.max_lvl, -1, -1):
            if r.widths[level] != i: 
                r = r.successors[level]
        return r 
    return None