LinkedList.py

# ----------------------------------------------------------------------------
# Created By: Francisco José Cardoso
# Created Date: 13/10/2022
# ---------------------------------------------------------------------------


class Node:
    def __init__(self, data):
        self.data = data
        self.next = None


class LinkedList:
    def __init__(self):
        self.head = None

    def append(self, data):
        new_node = Node(data)

        if self.head is None:
            self.head = new_node
            return

        current_node = self.head

        while current_node.next:
            current_node = current_node.next

        current_node.next = new_node
        return

    def lenght(self):
        if self.head == None:
            return 0
        current_node = self.head
        total = 0

        while current_node:
            total = total + 1
            current_node = current_node.next
        return total

    def to_list(self):
        node_data = []
        current_node = self.head

        while current_node:
            node_data.append(current_node.data)
            current_node = current_node.next
        return node_data

    def display(self):
        contents = self.head

        if contents is None:
            print("A lista está vazia")

        while contents:
            print(contents.data)
            contents = contents.next
        print("----------")

    def reverse_linkedlist(self):
        previous_node = None
        current_node = self.head
        while current_node is not None:
            next = current_node.next
            current_node.next = previous_node
            previous_node = current_node
            current_node = next
        self.head = previous_node


# Test
my_list = LinkedList()
my_list.display()

my_list.append(3)
my_list.append(5)
my_list.append(6)
my_list.append(9)

my_list.display()
my_list.lenght()