DeQueue Data Structure

DeQueue (or) Deque (Double ended Queue) :-

DeQueue is a data structure in which elements may be added to or deleted from the front or the rear.

Like an ordinary queue, a double-ended queue is a data structure it supports the following operations: enq_front, enq_back, deq_front, deq_back, and empty. Dequeue can be behave like a queue by using only enq_front and deq_front , and behaves like a stack by using only enq_front and deq_rear. .

The DeQueue is represented as follows.

Read more »

Priority Queue

Priority queue is a linear data structure. It is having a list of items in which each item has associated priority. It works on a principle add an element to the queue with an associated priority and remove the element from the queue that has the highest priority. In general different items may have different priorities.

Read more »

Queue Data Structure

• Queue is a linear data structure
• it works on the principle First In First Out (FIFO).
• The first element insert into the queue is the first element to be delete
• Insertion can be done at rear end using rear pointer and deletions can be done at front end using front pointer
• It looks like open tube.

Read more »

Applications of Stack Data Structure

The linear data structure stack can be used in the following situations.

1. It can be used to process function calls.

2. Implementing recursive functions in high level languages

3. Converting and evaluating expressions.

Read more »

Classification of Data structures

Data structures can be classified as

· Simple data structure

· Compound data structure

· Linear data structure

· Non linear data structure

Read more »

Data Structure Definitions

In computer science, a data structure is a way of storing data in a computer so that it can be used efficiently. Often a carefully chosen data structure will allow the most efficient algorithm to be used. The choice of the data structure often begins from the choice of an abstract data type. A well-designed data structure allows a variety of critical operations to be performed, using as few resources, both execution time and memory space, as possible. Data structures are implemented by a programming language as data types and the references and operations they provide.

Read more »