If FRONT = NULL then _________.

Related Questions

• A _____________ list is a list where the last node contains null pointer.
• A linked list whose last node points back to the list node instead of containing the null pointer________.
• __________________ is a header list where the last node contains the null pointer.
• The situation in linked list START = NULL is called_________
• What would be the asymptotic time complexity to insert an element at the front of the linked list (head is known)?
• A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a ?
• Which data structure allows deleting data elements from front and inserting at rear?
• The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a one needs a minimum of ?
• Pushing an element into stack already having five elements and stack size of 5, then stack becomes
• The post-order traversal of a binary tree is O P Q R S T. Then possible pre-order traversal will be