#### Min Heap Binary Tree

A Min Heap Binary Tree is a Binary Tree where the root node has the minimum key in the tree. The above definition holds true for all sub-trees in the tree. This is called the….

Data Structure and Algorithms are the building blocks of computer programming. A well-defined data structure helps us in keeping our data organized. Some of the commonly used data structures are List, Queue, Stack, Tree etc.

The algorithms provide different ways to achieve a task on these data structures. Some of the common algorithms are in the area of sorting and searching elements in the data structure.

A Min Heap Binary Tree is a Binary Tree where the root node has the minimum key in the tree. The above definition holds true for all sub-trees in the tree. This is called the….

A Trie data structure acts as a container for a dynamic array. In this article, we shall look at how we can implement a Trie in C/C++. This is based on the tree data structure….

The Selection Sort Algorithm sorts the elements of an array. In this article, we shall look at the core algorithm and how we can implement it in Python, Java, C++, and C. The Core Algorithm….

A queue in C is basically a linear data structure to store and manipulate the data elements. It follows the order of First In First Out (FIFO). In queues, the first element entered into the….

Depth First Search (DFS) is an algorithm that searches a graph/tree, in a depth-wise manner. There are many ways through which we can traverse through a graph. The two most common methods that we can….

In this article, we’ll touch upon the graph theory basics. Graph Theory is a branch of mathematics that aims at studying problems related to a structure called a Graph. In this article, we will try….

Introduction We worked on the working as well as the implementation of a Stack in C++ in our previous tutorial. Today in this tutorial, we are going to discuss another data structure, Queue in C++…..

When working with large databases, it is necessary to add the functionality to search for values or find the highest or lowest values from a range of items. The Bubble Sort Algorithm is an algorithm….

Linear Search is basically a sequential search algorithm. In this algorithm, the key element is searched in the given input array in sequential order. If the key element is found in the input array, it….

A stack is a linear data structure, collection of items of the same type. Stack follows the Last In First Out (LIFO) fashion wherein the last element entered is the first one to be popped….