Basic LinkedList implementation in Kotlin

LinkedList.kt

class LinkedList<T>() {
    private var head: Node<T>? = null
    private var lastNodePointer: Node<T>? = null
    
    public fun add(value: T) {
        val node = Node<T>(value)
        if (head == null) {
            head = node
            lastNodePointer = node
        } else {
            lastNodePointer?.next = node
            lastNodePointer = node
        }
	}
    
    public fun getHead() : Node<T>? {
        return head
    }
    
    public fun print() {
        var curr = getHead()
        while (curr != null) {
            print(curr.value.toString() + " ")
            curr = curr.next
        }
        println()
    }
}

class Node<T>(public val value: T) {
    public var next: Node<T>? = null
}

fun main() {
    val linkedList = LinkedList<Int>()
    linkedList.add(1)
    linkedList.add(2)
    linkedList.add(3)
    linkedList.print()
}