HR30 Day 15: Linked List/Python

개요

• HR30 Day 15: Linked List

class Node:
    def __init__(self,data):
        self.data = data
        self.next = None 
class Solution: 
    def display(self,head):
        current = head
        while current:
            print(current.data,end=' ')
            current = current.next

    def insert(self,head,data): 
        #Complete this method
        newNode = Node(data)
        if head is None:
            return newNode
        node = head
        while node.next is not None:
            node = node.next
        node.next = newNode
        return head

mylist= Solution()
T=int(input())
head=None
for i in range(T):
    data=int(input())
    head=mylist.insert(head,data)    
mylist.display(head)