DEQUE :
The deque stands for Double Ended Queue. Deque is a linear data structure where the insertion and deletion operations are performed from both ends.
Deque is a data structure that inherits the properties of both queues and stacks. Additionally, the implementation of this data structure requires constant time, i.e., time complexity = O(1). This means you can use deque to your advantage to implement both the queue and stack.
PRIORITY QUEUE :
A priority queue is a type of queue that arranges elements based on their priority values.
In computer science, a priority queue is an abstract data-type similar to a regular queue or stack data structure. Each element in a priority queue has an associated priority. In a priority queue, elements with high priority are served before elements with low priority.
Please subscribe and support my youtube Channel :-)
#meghuZLearning
#btech #computer #computerapplication #diploma #psc #polytechnic #ds #datastructure #queues #deque #prority
#priorityqueue #s3 #ktu #malayalam
