def partList(ll, n):

    more = LinkedListFIFO()
    less = LinkedListFIFO()

    node = ll.head

    while node:
        item = node.value

        if n < item:
            less.addNode(item)

        elif item > n:
            more.addNode(item)

        node = node.pointer

    less.addNode(n)
    nodemore = more.head

    while nodemore:
        less.addNode(nodemore.value)
        nodemore = nodemore.pointer

    return less
dataset/ETHPy150Open bt3gl/Python-and-Algorithms-and-Data-Structures/src/abstract_structures/linked_list/part_linked_list.py/partList/swapped operands of `<`