# Category Archives: Data Structure

## DSA: Hashing

Though using an Array, we can search an element with time complexity O(1), but the array has its limitation such as it stores similar data types, each cell of array occupies the same amount of space and to find an element we require its index value. To find the Index value of an element itself… Read More »

## Data Structure & Algorithm: Interpolation Search

Interpolation search is a searching algorithm that applies on a sorted & equally distributed array, and it is an Improved variant of Binary Search. Like binary search, it uses the divide and conquers algorithm, but unlikely, it does not divide the array into two equal parts to search the element. As compared to a linear… Read More »

## Bellman-Ford Algorithm

Bellman-Ford Algorithm, which can apply on weighted Graph Data Structure, to find the shortest path between a source vertex to all other vertices. The algorithms can be only be applied on the weighted Graph, with negative weight edges. Though we have Dijkstra’s Algorithm to find the shortest path between vertices, it can not find the… Read More »

## What is Structured Programming?

There are many Programming paradigms we use in programming languages, and the Programming paradigm deals with how the problem will be solved using a programming language. A Programming language can consist of more than one programming paradigm which makes it more efficient. The programming paradigm also controls the flow of program execution, and here in… Read More »

A circular doubly list is a combination of doubly and circular list, which mean it consists of the properties of both the Data structures, which make this data structure more complex. Similar to the circular linked list while performing traversing in the circular doubly linked list could lead to an infinite loop so while writing… Read More »

## Fibonacci Series

A fibonacci series is a special number of series which follow a pattern in which the next number of series is the sum of the previous two numbers. The Fibonacci series starts with two numbers 0 and 1. There is are two rules we need to follow to create a Fibonacci series: The series must… Read More »

## DSA: Program for Tower of Hanoi

Tower of Hanoi is a popular math puzzle in which we have given 3 towers and one of those towers has n number of rings of a different shape. We need to move those rings from one tower to another and collect all rings in another tower in the exact same sequence. All the rings… Read More »

## DSA: Recursion

In Programming, we have a concept that is super important when we deal with the implementation of trees and graph data structure and it is called recursion. Recursion is a technique offered by many programming languages in which a user-defined function can call itself again and again until a base condition gets satisfied.

## DSA: Binary Heap Tree

A Heap binary tree is a balanced binary data structure where the parent node either be larger or smaller than its child node, depends upon the type of heap binary structure. The binary heap was first introduced in 1964 by J.W.S Williams, as a data structure for heap sort. We commonly use a heap binary… Read More »

## DSA: Graph- Spanning Tree

Spanning Tree concept in Computer science is related to the Graph Data Structures, so do not confuse it with trees. A Spanning Tree is a subgraph or subset of a Graph G which contain all the vertices of the Graph G with the minimum number of edges. A graph can have more than one spanning… Read More »