यदि एक डबली लिंक्ड लिस्ट (doubly linked list) में क्रमिक रूप से नोड A, B, C, D, E, F हैं और एक पॉइंटर 'p' नोड E की ओर संकेत करता है, तो 'p->previous->next' क्या प्राप्त करेगा?

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;