Concurrent queues and stacks are important components of many software systems.
They are well-known contended data structures due to intense contention on hotspots, resulting in limited performance and poor scalability. To ensure robust performance, they pursue lock-free progress to avoid adverse effects brought by complex systems environments, such as scheduling. To achieve higher performance, several attempts applied the batching technique, that packs a group of standard operations into a single batch for execution, to lock-free queues and stacks bulit upon the linked list, but still inherited the contended compare-and-swap (\texttt{CAS}). Especially for concurrent queues, these attempts fail to outperform modern queues constructed by fetch-and-add (\texttt{FAA}) under high contention. Unfortunately, it can be very difficult to integrate the batching technique into \texttt{FAA}-based queues for improvement due to their array nature. In this paper, we creatively employ an auxiliary version log to construct multiple versions of the queue or stack to make the batching technique benefit from \texttt{FAA}, getting rid of the inherent \texttt{CAS} contention. In our evaluation, our new design can achieve 12.85x throughput of the state-of-the-art lock-free queue supporting batching, and achieve 4.19x throughput of the fastest lock-free queue when the batch size is 50. Also, for concurrent stacks, our design can achieve 2.9x throughput of the existing work supporting batching and 46.41x throughput of the classic lock-free stack when the batch size is 50.