1. Condition to enqueue an element in a linear Queue
2.Which of the following data structures follows the Last In, First Out (LIFO) principle?
4.In a doubly linked list, each node contains how many pointers/references to other nodes?
5.Which of the following is not a type of tree traversal
6.Which data structure is used to implement recursion efficiently?
7.Which of the following is a linear data structure?
8. Condition to move to next postion while dequeue an element in a circular Queue
9. A node in a Linkedlist consist of how many parts ?
10.What does FIFO stand for in the context of data structures?