链表插入和反向输出

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

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

    def insert_at_end(self, data):
        new_node = Node(data)
        if not self.head:
            self.head = new_node
        else:
            current = self.head
            while current.next:
                current = current.next
            current.next = new_node

def reverse_print(head):
    if head is None:
        return
    reverse_print(head.next)
    print(head.data)

def reverse_print_iterative(head):
    stack = []
    current = head
    while current:
        stack.append(current.data)
        current = current.next
    while stack:
        print(stack.pop())

def reverse_and_print(head):
    prev = None
    current = head
    while current:
        next_node = current.next
        current.next = prev
        prev = current
        current = next_node
    while prev:
        print(prev.data)
        prev = prev.next