# DSA

In this article, we will take a look at the advantages and disadvantages of one of the most basic data structures in programming – Arrays. But before that, let us have a brief understanding of what arrays are. An array is one of the most popular data structures in various programming languages like C, C++, …

## Polish Notation in Data Structure

In this article, we will look into Polish notation in Data Structures. We will discuss its types along with some examples and the use of such notations in general. Polish Notation is a general form of expressing mathematical, logical and algebraic equations. The compiler uses this notation in order to evaluate mathematical expressions depending on …

## 2-3-4 Trees – Properties, Insertion, Deletion, Time Complexity & Applications

In this article, we will learn about 2-3-4 Trees. We will look at the creation of 2-3-4 trees and look at the operations performed on this trees with examples. We will also look at the time for each operation and its applications. 2-3-4 Tree is a Self-balancing, Multiway Search Tree. It is always perfectly balanced. …

## Detect and Remove Loop in a Linked List

In this article, we will look at an interesting problem related to Linked List . ‘Given a Single Linked List, Remove Loop if there exists any’. We will look at different ways to solve this problem and analyze the complexities of our approach. Now, To Remove a Loop in a Linked List, we need to …

## Longest Palindromic Subsequence in Java

In this article, we will look at yet another interesting problem popular in coding interviews. The problem states that Given a String we have to Find the Longest Palindromic Subsequence present in the String. We need to find only the Length of such subsequence. We will discuss various approaches related to our problem and analyze …

## Balanced Binary Tree – Definition, How to Check, Time & Space Complexity

In this article, we take a look into an important type of Binary Tree based Data Structure – Balanced Binary Tree. We will discuss the description of balanced binary trees with examples. Along with this, we will also look at an interesting problem related to it. Definition A Balanced Binary Tree commonly referred to as …

## Max Heap vs Min Heap

In this article, we will have a look at the difference between Max Heap and Min Heap Data Structure. We will look at the description of each data structure and examples related to them. Firstly, let us have a quick recap of the Heap Data Structure. Heap is a special type of binary tree based …