किस प्रकार की लिंक्ड लिस्ट में यह गारंटी होती है कि प्रत्येक नोड का एक नॉन-नुल (non-null) सक्सेसर नोड होता है?

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;