Linked List Algoritması

1class ListNode {
2  constructor(
3    public value: T,
4    public next: ListNode | null = null
5  ) {}
6}
7
8class LinkedList {
9  private head: ListNode | null = null;
10  private tail: ListNode | null = null;
11
12  add(value: T) {
13    const node = new ListNode(value);
14    if (!this.head) {
15      this.head = node;
16      this.tail = node;
17      return;
18    }
19    this.tail!.next = node;
20    this.tail = node;
21  }
22
23  contains(value: T) {
24    let current = this.head;
25    while (current) {
26      if (current.value === value) return true;
27      current = current.next;
28    }
29    return false;
30  }
31}