Design a Thread-Safe Queue Independent of Multithreading Issues

Requirements: Design a Queue data structure that is safe to use concurrently from multiple threads without race conditions or corrupted state.

Design: Guard the internal array/linked-list state with a mutex (or use a lock-free ring buffer with atomic head/tail indices for higher throughput). Ensure enqueue/dequeue operations acquire the lock for the minimal critical section (updating head/tail pointers and size), and consider blocking (condition variable wait when empty/full) vs non-blocking (return failure/Optional when empty/full) semantics for callers.