Implement a Circular Doubly Linked List

Problem

Implement a circular doubly linked list with insert, delete, and traverse.

Example

insert at head/tail, delete arbitrary node, traverse forward and backward

Constraints

• Handle empty list and single-node edge cases

What to look for

Correct pointer rewiring with no leaks or dangling references.