Category Archives: Data Structure

What is Structured Programming?

Here in this article, we are going to discuss the definition of structured programming, its advantages and disadvantages. There are many programming paradigms we use in programming languages. They determine the way in which a programming language solves a particular problem. A programming language can consist of more than one programming paradigms. The programming paradigm also controls the… 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 start with 0… 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 are of different… 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.

AVL Tree

AVL tree stands for Adelson-Velsky and Landis Tree and it is a self-balancing Binary Search tree. AVL tree is the extension of Binary Search tree Data Structure. It reduces the time complexity of the many operations of Binary Search Tree. The name of this tree Data Structure AVL is named after its inventor Adelson-Velsky and Landis and they… Read More »

DSA Binary Search Tree

A Binary Search Tree is a special Binary tree (each parent node can have maximum 2 node), which satisfy the following condition. The tree must be a binary search tree. The left sub-tree key value should be less than the parent node key value. The right-sub tree key value should be greater than the parent node key value.