Data structures - stacks, queues, linked list

What is the time complexity of inserting an element at the top of a stack?

Which of the following data structures follows the Last-In-First-Out (LIFO) principle?

What is the main advantage of using a linked list over an array?

Which data structure allows elements to be added or removed from both ends?

What is the time complexity of searching for an element in a sorted array using binary search?

Which data structure follows the First-In-First-Out (FIFO) principle?

What is the main disadvantage of using an array to implement a stack?

Which data structure is best suited for implementing a breadth-first search algorithm?

What is the time complexity of inserting an element at the rear of a queue?

Which data structure allows elements to be accessed from both ends but does not support random access?