ठीक पांच नोड्स वाली एक वृत्ताकार, दोगुनी लिंक्ड सूची (circular, doubly linked list) के नोड्स में डेटा सदस्यों के रूप में कुल कितने पॉइंटर्स होते हैं?

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;