Home Data Structures

# Data Structures

Data Structures

### Rabin-Karp Algorithm for String Searching & Pattern Matching

Nlogn Team - 0

Rabin-Karp is a pattern-matching algorithm that works by calculating the hash of the pattern to be searched(say Length M) and the hash of M...

Data Structures

### Distance, Diameter, Eccentricity, Radius and Center of a Graph

Nlogn Team - 0

A graph is defined as a set of Vertices and lines joining these vertices known as Edges. Today we will learn about various properties...

Data Structures

### HeapSort Algorithm Tutorial and Implementation

Nlogn Team - 1

HeapSort is an efficient (O(N*lognN) time) comparison-based sorting algorithm based on Binary Heaps. It works by dividing input unsorted array into the sorted and...

Data Structures

### Build Heap and Heapify Operation [Tutorial]

Nlogn Team - 0

Build Heap is a process of building a Heap from a given element generally in an array format. The resulting heap will be either...

Data Structures

### Binary Heap Data Structure [Introduction]

Nlogn Team - 0

A Binary Heap is a form of Binary Tree with the following additional properties -
A Binary Heap is a complete Binary tree with...

Data Structures

### Check if a Binary Tree is a Binary Search Tree

Nlogn Team - 0

Given a Binary Tree, we have to validate whether it is a valid Binary Search Tree(BST) or not. Print true, if given Binary Tree...

Data Structures

### Sieve of Eratosthenes

Nlogn Team - 0

Sieve of Eratosthenes is an algorithm to find all prime numbers up to a given range. This concept is very important when it comes...

Data Structures

### AVL Tree Deletion Tutorial

Nlogn Team - 0

AVL tree is a height-balanced Binary Search Tree(BST) with best and worst-case height as O(log N). In AVL tree the difference of height of...

Data Structures

### AVL Tree Insertion Tutorial

Nlogn Team - 0

AVL tree is a height-balanced Binary Search Tree(BST) with best and worst-case height as O(log N). In AVL tree the difference of height of...

Data Structures

### Introduction to AVL Tree and its properties

Nlogn Team - 0

AVL tree(Adelson-Velsky and Landis tree named after it's inventor) is a height-balanced Binary Search Tree such that the difference between the height of a...

### Subscribe to our newsletter

To be updated with all the latest news, offers and special announcements.

Even we hate spam as much