find the median of all nodes in a linked list in python

main.py
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 not self.head:
            self.head = new_node
            return

        current = self.head
        while current.next:
            current = current.next

        current.next = new_node

    def find_median(self):
        if not self.head:
            return None

        current = self.head
        values = []
        while current:
            values.append(current.data)
            current = current.next

        values.sort()
        n = len(values)
        if n % 2 == 0:
            median = (values[n//2-1] + values[n//2]) / 2
        else:
            median = values[n//2]

        return median
846 chars
41 lines