What operations can be performed on Queues?
The below operations can be performed on a queue −
enqueue() − adds an item to rear of the queue
dequeue() − removes the item from front of the queue
peek() − gives value of front item without removing it
isempty() − checks if stack is empty
isfull() − checks if stack is full
What are the differences between AVL Tree & Binary Search Tree ?
What is a priority queue ?
What is a self referential structure? What is difference between Union & Structure?