Method print_list

Sorting Algorithims/heapsort_linkedlist.py:16–21

(self)

        self.head = new_node

    def print_list(self):
        current = self.head
        while current:
            print(current.data, end=" -> ")
            current = current.next
        print("None")

    def heapify(self, n, i):
        largest = i