Data structures such as arrays, lists, stacks, queues, and trees are abstractions in what way?

This is due, in part, to compilers' use of Abstract Syntax Trees (AST) for code optimization.

Modern language compilers offer multiple categories, levels, or implementations of the idea of abstract data types, or does one definition suit all, please explain why or why not, provide an example?

Elaborate a C program of a circular static queue, where you can add an element, remove an element, show the queue, check if the queue is full, check if the queue is empty, and exit the program. Specify what is the structure of the queue, what are the function prototypes and what is the main function.