LinkedList Implementation with generics (typescript) Data structures

linkedlist.ts

// this is for the Node
class MyNode<T>{
    public data: T;
    public next: MyNode<T> | any ;
    constructor(data: T) {
        this.data = data;
        this.next = null
    }
}

// this is for the linkedlist

class Mylinkedlist<T>{
    public head: MyNode<T>;
    public size: number;
    constructor() {
        this.size = 0
    }
    public append(data: T): void {
        if (!this.head) {
            this.head = new MyNode(data)
            this.size++;
            return
        }
        let current: MyNode<T> = this.head;

        while (current.next != null) {
            current = current.next;
        }
        current.next = new MyNode(data)
        this.size++
    }
    public prepend(data: T): void {
        let newHead: MyNode<T> = new MyNode(data)
        newHead.next = this.head
        this.head = newHead;
    }
    public deletenode(data: T): void {
        //delete the node if its the head
        let current: MyNode<T> = this.head
        if (this.head == null) return; //if no head return
        if (this.head.data == data) {
            this.head = this.head.next;
            this.size--;
            return
        }
        // when you want to delete node inbetween another
        while (current.next != null) {
            if (current.next.data == data) {
                current.next = current.next.next;
                this.size--;
                return
            }
            current = current.next;
        }
    }
    public printLinkedlist(): void {
        let current:MyNode<T> = this.head
        let format: any = '';
        
        while (current) {
            if (current.data != null) {
                format += "-->"+ current.data;
            }
            current = current.next;
        }
        // get the first part of linkedlist item
       console.log("null"+format)
    }
}

let l: Mylinkedlist<number> = new Mylinkedlist()
l.append(2)
l.append(12)
l.append(122)
l.append(142)
l.append(17)
l.append(22)
l.prepend(667)

// l.deletenode(667)
// l.deletenode(12)

l.printLinkedlist()

You could make even better guys