प्रत्येक पंक्ति और कॉलम में गैर-शून्य तत्वों (non-zero elements) की कम संख्या वाले आव्यूह (matrices) के लिए कौन सा प्रतिनिधित्व सबसे उपयुक्त है?

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;