Singly Linked List Visualizer

insertHead(v):  node = new Node(v)  node.next = head  head = nodeinsertTail(v):  node = new Node(v)  if head = null: head = node; return  cur = head  while cur.next ≠ null: cur = cur.next  cur.next = nodeinsertAt(i, v):  if i = 0: insertHead(v); return  cur = head; repeat i − 1 times: cur = cur.next  node = new Node(v)  node.next = cur.next  cur.next = nodedelete(v):  if head.value = v: head = head.next; return  prev = head  while prev.next ≠ null and prev.next.value ≠ v: prev = prev.next  if prev.next = null: return   // not found  prev.next = prev.next.next  free the removed nodesearch(v):  cur = head; i = 0  while cur ≠ null: if cur.value = v: return i    cur = cur.next; i = i + 1  return −1reverse():  prev = null; cur = head  while cur ≠ null    next = cur.next    cur.next = prev    prev = cur; cur = next  head = prev

struct Node { int value; Node* next; };

class LinkedList {
    Node* head = nullptr;
public:
    void insertHead(int v) { head = new Node{v, head}; }
    void insertTail(int v) {
        Node* node = new Node{v, nullptr};
        if (!head) { head = node; return; }
        Node* cur = head;
        while (cur->next) cur = cur->next;
        cur->next = node;
    }
    void insertAt(int i, int v) {
        if (i == 0) { insertHead(v); return; }
        Node* cur = head;
        for (int k = 1; k < i; k++) cur = cur->next;
        cur->next = new Node{v, cur->next};
    }
    void remove(int v) {
        if (!head) return;
        if (head->value == v) { Node* t = head; head = head->next; delete t; return; }
        Node* prev = head;
        while (prev->next && prev->next->value != v) prev = prev->next;
        if (prev->next) { Node* t = prev->next; prev->next = t->next; delete t; }
    }
    int search(int v) const {
        int i = 0;
        for (Node* cur = head; cur; cur = cur->next, i++)
            if (cur->value == v) return i;
        return -1;
    }
    void reverse() {
        Node *prev = nullptr, *cur = head;
        while (cur) { Node* next = cur->next; cur->next = prev; prev = cur; cur = next; }
        head = prev;
    }
};

class LinkedList {
    static class Node { int value; Node next; Node(int v, Node n) { value = v; next = n; } }
    Node head;

    void insertHead(int v) { head = new Node(v, head); }
    void insertTail(int v) {
        Node node = new Node(v, null);
        if (head == null) { head = node; return; }
        Node cur = head;
        while (cur.next != null) cur = cur.next;
        cur.next = node;
    }
    void insertAt(int i, int v) {
        if (i == 0) { insertHead(v); return; }
        Node cur = head;
        for (int k = 1; k < i; k++) cur = cur.next;
        cur.next = new Node(v, cur.next);
    }
    void remove(int v) {
        if (head == null) return;
        if (head.value == v) { head = head.next; return; }
        Node prev = head;
        while (prev.next != null && prev.next.value != v) prev = prev.next;
        if (prev.next != null) prev.next = prev.next.next;
    }
    int search(int v) {
        int i = 0;
        for (Node cur = head; cur != null; cur = cur.next, i++)
            if (cur.value == v) return i;
        return -1;
    }
    void reverse() {
        Node prev = null, cur = head;
        while (cur != null) { Node next = cur.next; cur.next = prev; prev = cur; cur = next; }
        head = prev;
    }
}

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

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

    def insert_head(self, v):
        self.head = Node(v, self.head)

    def insert_tail(self, v):
        node = Node(v)
        if self.head is None:
            self.head = node
            return
        cur = self.head
        while cur.next:
            cur = cur.next
        cur.next = node

    def insert_at(self, i, v):
        if i == 0:
            return self.insert_head(v)
        cur = self.head
        for _ in range(i - 1):
            cur = cur.next
        cur.next = Node(v, cur.next)

    def delete(self, v):
        if self.head is None:
            return
        if self.head.value == v:
            self.head = self.head.next
            return
        prev = self.head
        while prev.next and prev.next.value != v:
            prev = prev.next
        if prev.next:
            prev.next = prev.next.next

    def search(self, v):
        cur, i = self.head, 0
        while cur:
            if cur.value == v:
                return i
            cur, i = cur.next, i + 1
        return -1

    def reverse(self):
        prev, cur = None, self.head
        while cur:
            cur.next, prev, cur = prev, cur, cur.next
        self.head = prev

class Node {
  constructor(value, next = null) { this.value = value; this.next = next; }
}
class LinkedList {
  constructor() { this.head = null; }
  insertHead(v) { this.head = new Node(v, this.head); }
  insertTail(v) {
    const node = new Node(v);
    if (!this.head) { this.head = node; return; }
    let cur = this.head;
    while (cur.next) cur = cur.next;
    cur.next = node;
  }
  insertAt(i, v) {
    if (i === 0) return this.insertHead(v);
    let cur = this.head;
    for (let k = 1; k < i; k++) cur = cur.next;
    cur.next = new Node(v, cur.next);
  }
  delete(v) {
    if (!this.head) return;
    if (this.head.value === v) { this.head = this.head.next; return; }
    let prev = this.head;
    while (prev.next && prev.next.value !== v) prev = prev.next;
    if (prev.next) prev.next = prev.next.next;
  }
  search(v) {
    let i = 0;
    for (let cur = this.head; cur; cur = cur.next, i++) if (cur.value === v) return i;
    return -1;
  }
  reverse() {
    let prev = null, cur = this.head;
    while (cur) { const next = cur.next; cur.next = prev; prev = cur; cur = next; }
    this.head = prev;
  }
}