लॉजिक कोड: if (rear == maxsize - 1) rear = 0; else rear = rear + 1; का उपयोग किस डेटा संरचना में प्रविष्टि (insertion) के लिए किया जाता है?

What is the worst-case time complexity of inserting 'n' elements into an initially empty linked list such that the linked list remains sorted?

What are the contents of an initially empty stack (from bottom to top) after performing the following operations? PUSH(A); PUSH(B); PUSH(C); POP; PUSH(D); POP; POP; PUSH(E); PUSH(F); POP;