The big o notation of the worst case scenario of pushing back an element into a queue implemented using a list is _______________

A queue could be implemented as an array or a linked list with very different insertion, removal, and indexing characteristics.
In computer science, an array is a data structure consisting of a collection of elements, each identified by at least one array index or key.
An array is stored such that the position of each element can be computed from its index tuple by a mathematical formula
The array in C has a fixed size, which means that once the size is specified, it cannot be changed; you cannot shrink or expand it.
The rationale behind this was that, when expanding, we cannot always be certain that we will receive the subsequent memory location for free (it is not always possible).
The array is memory statically allocated when it is declared, making it impossible to shrink because only the compiler has the power to do so.
The first element of the array is indexed by the subscript 0, for zero-based indexing; by the subscript 1, for one-based indexing; and by the subscript n, for N-based indexing.
An array's base index can be chosen at will.
Negative index values are typically permitted in programming languages that support n-based indexing, and other scalar data types, such as enumerations or characters, may also be used as array indexes.

To learn more about Array, refer

to https://brainly.com/question/25922783

#SPJ4