In C, we have an option to set any other name for a specific data type. For doing that we use a keyword called "typedef". In this article, I'll be explaining how typedef works and...

While coding in C, you will come across many data types like - char, int, float, double, void, and so on... These data types are called basic data types. There's another group of data types...

List is a data structure used in Python. It is similar to the concept of arrays but unlike arrays they're more flexible about the type of data that is being stored in them. It is very easy t...

A heap is a Complete Binary Tree in which elements are arranged in a specific order depending the type of Heap that we're trying to implement. It can be either the first element(root node) b...

A Max Heap is a Complete Binary Tree containing the largest value in the root node followed by smaller and smaller values in each succeeding layer. The last layer contains the smallest set o...

A heap is a Complete Binary Tree having its nodes or elements in an ordered way. Based on this order, we define two types of Heap data structures - Min Heaps and Max Heaps. In this tutorial,...

In this post, I'm gonna share some basic knowledge about a concept of data structures called "Complete Binary Trees". We're just gonna build upon the concept of Binary trees here....

A Heap is a specific kind of Binary Tree called Complete Binary Tree, arranged in a specific order. In this article, I'm gonna tell you what exactly we mean by a "Heap", different...

In this article we're gonna see a basic layout of the Quicksort Algorithm and how we can implement it in C language. What is Quicksort Algorithm? It is a simple sorting algorithm that works...

Imagine that you've been eyeing a book for sometime and you wanna buy it. You try to look it up on Amazon.com but without a search option. No wonder how tedious it would be to find it withou...

Insertion sort is a technique of sorting wherein you build a sorted array from an unsorted one by picking wrongly placed elements from the unsorted part of the array and placing them at the...

In this article I'm gonna talk about selection sort algorithm and how to implement it in C language. What is Selection Sort? The main idea behind this sorting algorithm is to scan the unsort...

Sorting means to arrange a group of things in a specific order. Algorithms that help us sort a group of items are called Sorting Algorithms. In this article I'm gonna give a brief introducti...

Linear Search and Binary Search are two popular searching algorithms. In this article, we'll be comparing the two algorithms in order to find out which algorithm is better based on their app...

Previously, we briefly discussed about time complexity of algorithms. You can check it out here if you haven't yet. In this post we'll learn about the concept of time complexity in a more de...

Searching algorithms are designed to locate the position of an element (if present) in a data structure. To search for an element in a linear data structure like an array, we can use many di...

So far we've discussed about how we can perform certain operations on a Binary Search Tree. It is no fun to learn about new stuff when you don't know where exactly you can use it. So, In thi...

In this article I'm gonna talk about how we can find the k'th maximum element in a given Binary Search Tree. Previously we talked about the methods of finding the k'th minimum element in a B...

A Binary Search Tree is a Tree in which each node has not more than two child nodes, and each of the child nodes are inserted in the tree based on a certain rule - the left child should have...

Binary trees are a type of Tree data structure wherein each node has at-most 2 child nodes. We've already discussed about Tree data structure. So, in this article we're gonna talk about the...

A Tree is a non linear data structure. Unlike the data structures that we've learned so far like - Linked Lists, Stacks, Queues, etc. In this type of data structure, one element can be linke...

Till now we've talked about linked lists and the basic operations associated with it. But today we're gonna talk about linked lists only, but with a slight variation. In a linked list, trave...

A stack is a linear data structure in which operations can be done in a specific order. Stacks follow the LIFO (Last In First Out) Principle. I'm sure you might've heard of a stack of differ...