Understand node-based sequential structures. Linked lists are O(1) insertion/deletion at known position, but O(n) access. Compare to arrays.

• Node-based sequential structures

class Node {
  constructor(val) {
    this.val = val;
    this.next = null;
  }
}
// ...

• Linked list insertion works

• Each node has a value and reference to next node
• Traversal is O(n); insertion at known node is O(1)
• Doubly-linked lists allow bidirectional traversal

Understand node-based sequential structures. Linked lists are O(1) insertion/deletion at known position, but O(n) access. Compare to arrays.

• Node-based sequential structures

class Node {
  constructor(val) {
    this.val = val;
    this.next = null;
  }
}
// ...

• Linked list insertion works

• Each node has a value and reference to next node
• Traversal is O(n); insertion at known node is O(1)
• Doubly-linked lists allow bidirectional traversal