Data Structures: Singly Linked List (Insert, Delete, Reverse & Middle)

Implement a comprehensive SinglyLinkedList in C++:

• ◦
  struct Node { int data; Node* next; };

• ◦
  void insertHead(int val): Inserts at the beginning in $O(1)$.
• ◦
  void insertTail(int val): Appends to the end.
• ◦
  void insertAt(int index, int val): Inserts at zero-based position index.
• ◦
  bool deleteNode(int val): Searches for val and removes the first matching node, releasing memory with delete.
• ◦
  void reverse(): Reverses the linked list in-place using a 3-pointer iterative algorithm (prev, curr, next).
• ◦
  int findMiddle() const: Uses Floyd's Tortoise and Hare (Slow & Fast pointers) to return the middle node value in a single pass.
• ◦
  void display() const: Prints the chain in 10 -> 20 -> 30 -> nullptr format.

• ◦
  Build list: insertTail(10), insertTail(20), insertTail(30), insertTail(40), insertTail(50).
• ◦
  Print original list and find middle element (should be 30).
• ◦
  Reverse list and display (50 -> 40 -> 30 -> 20 -> 10 -> nullptr).
• ◦
  Delete node 30 and display updated chain.