Now 47 will be deleted means 57 will its place, and the rear moves left means the rear will be in the 0th position. Step 6: Again, perform the delete operation Now 37 will be deleted means 47 will its place, and the rear moves left means rear will be in 1st position. Now 27 will be deleted means 37 will its place, and the rear moves left means the rear will be in 2nd position. Step 4: Again, perform the delete operation Now 17 will be deleted means 27 will its place, and the rear moves left means the rear will be in 2nd position. Step 3: Again, perform the delete operation Here rear will skip one step left, as you can notice it. Now, the front marks the first element, but the first element will be 17 as all the elements move left when one element is deleted. Step 1: Here, first element '7' is marked as the front-end element, and last element 57 is marked as the rear element.ДЄs we know in Queue, the first element only gets deleted whenever we perform a delete operation. Once person A finishes work, person B will take the first position, and person C will move ahead.Д®xample: Imagine a linear data structure with six elements 7,17,27,37,47,57 Look at the image here for a better understanding. Simply everyone moves one step ahead right here. The first person in the Queue leaves once work is done, so the second person in Queue will become the first person.

To understand linear Queue simply, imagine you are in a normal Queue in the bank where whenever a new person adds to the Queue, he/she will stand at the end. The Linear Queue mainly has two ends, one in front and the other in the rear end. To remove a new element from the Queue, all the elements inserted before the new element must be removed.

Queues are arranged in a FIFO (First In, First Out) structure.ДЈ. Similar to a stack, the Queue is a list of items with similar data types.Дў. The following are the features of linear queue:ДЎ. The very basic principle of Queue is 'First in, First Out' it means the element inserted first will get deleted first when the delete operation takes place. Before stepping into the main topic, we need to understand the basic working of a queue. Linear data structure Queue has data elements that are arranged sequentially. As of now, we will discuss the Linear model Linear Data Structure Queue There are two types of queues one is linear, and the other is circular. We all know that data structure is a way of storing or arranging data so that we can use it efficiently. There are many ways to store data in programming, that Queue has features that make it all the more special. Data Structures Tutorial Data Structures Tutorial Asymptotic Notation Structure and Union Array Data Structure Linked list Data Structure Type of Linked list Advantages and Disadvantages of linked list Queue Data Structure Implementation of Queue Stack Data Structure Implementation of Stack Sorting Insertion sort Quick sort Selection sort Heap sort Merge sort Bucket sort Count sort Radix sort Shell sort Tree Traversal of the binary tree Binary search tree Graph Spanning tree Linear Search Binary Search Hashing Collision Resolution Techniques Misc Topic: Priority Queue in Data Structure Deque in Data Structure Difference Between Linear And Non Linear Data Structures Queue Operations In Data Structure About Data Structures Data Structures Algorithms Types of Data Structures Big O Notations Introduction to Arrays Introduction to 1D-Arrays Operations on 1D-Arrays Introduction to 2D-Arrays Operations on 2D-Arrays Strings in Data Structures String Operations Application of 2D array Bubble Sort Insertion Sort Sorting Algorithms What is DFS Algorithm What Is Graph Data Structure What is the difference between Tree and Graph What is the difference between DFS and BFS Bucket Sort DijkstraвЂ™s vs Bellman-Ford Algorithm Linear Queue Data Structure in C Stack Using Array Stack Using Linked List

Queue data structure