Queues, Deques and Priority Queues

Hello! How are you?
As we discussed in the previous post on stacks,

The linear arrays discussed in the previous posts allows one to insert and delete at any position in the list – at the beginning, at the middle or at the end. There are certain frequent situations in computer science when one wants to restrict insertions and deletions so that they can take place only at the beginning or at the end of the list, not at the middle. Two of the data structures that are useful in such situations are queues and stacks.

As we completed our analysis of stacks in the previous post, here, in this post we will continue it with our analysis of queues. Hence lets get started!

Searching in Data Structures

Hey Guys! How're you doing?
Today we would look at another data structure operation, performed on linear arrays; Searching. This operation can be imagined as a person trying to search for a record amongst a list of records. Naturally we would also try to perform our search in the fastest possible time. Hence let us study more about searching in data structure, along with the two different approaches we can follow to perform searching in data structures, namely Linear Search and Binary Search.

Traversal, Insertion & Deletion in Arrays

Hello people! How are you?
In this lesson we would be performing insertion, deletion and traversal in an array. These are pretty straight forward data structure operations which I do not think you guys would have much difficulty in understanding. Hence lets get started!

Algorithms, Complexity and Space-Time Tradeoff

Hey guys! How're you doing!
Today we will go through another conceptual topic of Algorithms and the related terminologies like Space-Time Tradeoff and Complexity of an algorithm. Hence lets get started!

Data Structures | Introduction and Types

Hello everyone! Today we are going to start with a new topic in general. Data Structures! Hence lets get started with an introduction!