Method split

recipes/Python/578879_Highly_branched_Trees/recipe-578879.py:39–48

(self)

        self.key = childs[0].key
        
    def split(self):
        l = self.data
        if len(l)<nmax:
            return (self,)
        n = nmax/2
        r = []
        while l:
            r.append(Node(l[:n]))
            l = l[n:]
        return tuple(r)
        
    def insert(self, key, value):
        last = None