Data Structure topics

Implementing a Binary Search Tree (BST) in C++

In this article, we have explained the idea of implementing Binary Search Tree (BST) from scratch in C++ including all basic operations like insertion, deletion and traversal.

Data Structures

Sort a stack using another stack

In this article, we have explored an algorithm to sort a stack using another stack that is by using stack operations like push and pop only. The time complexity of this approach is O(N^2) and space complexity is O(N).

Algorithms

Hashed Array Tree: Efficient representation of Array

Hashed Array Tree is an improvement over Dynamic Arrays where there can be a large amount of unused allocated memory at a time. This can be visualized as a 2 dimensional array and has been developed by Robert Sedgewick, Erik Demaine and others.

Algorithms

Reverse alternate groups of K nodes in a Singly Linked List

We are given a pointer to the head of a singly Linked List and you have to write a function to reverse the elements of the given singly Linked List in alternate groups of K nodes. Once the operation is performed, pointer to the head of the Linked List must be returned from the function.

Data Structures

Introduction to AA trees

AA trees were introduced by Arne Andersson in 1993 and hence the name AA. They are a type of balanced binary search trees. It was developed as a simpler alternative to Red Black trees.

Data Structures

Implementing Binary tree in C++

In this article, we have explored how to implement Binary Tree Data Structure in C++ including all different operations like traversing, inserting and deleting. We have used Object Oriented Programming (OOP) concepts.

Algorithms

Reverse a linked list using 2 pointers technique using XOR operator

You must have come across reversing a linked list using 3 pointers technique which is the most common approach to do it. But do you know how to reverse a linked list with just 2 pointers? This article will teach you just that! Let's dive into it.

Data Structures

Circular Linked List

Circular Linked list is a complex form of a linked list data structure as within a circular linked list the last node points to the first node of the list. We have covered it in detail with all operations and implementation in Java.

Data Structures

Applications of Queue

We have covered all applications of queue. Some of the algorithms were it is used are CPU Scheduling (First-Come-First-Serve), Breadth First Search Traversal, Level Order Traversal of a tree, Edmonds Karp Algorithm, Dinic's Algorithm and Fibonacci Heap. We have explored some of the problems as well.

Data Structures

Types of Queue and their implementations

Queue is a FIFO (first in first out) data structure. The different types of queues are linear queue, circular queue, priority queue and deque. We have explored the types along with implementations.

Data Structures

Dynamic Stack

Dynamic Stack, just like Dynamic Array, is a stack data structure whose the length or capacity (maximum number of elements that can be stored) increases or decreases in real time based on the operations (like insertion or deletion) performed on it.

Python

Node structure of different trees in Python

We have explored the node structure in Python of different trees in data structure. This gives fundamental idea of implementing such trees in Python. Some of the trees we explored are Binary Tree, Binary Search Tree (BST), AVL Tree, B Tree, B+ Tree, Red-Black Tree, Treap, Splay Tree and R Tree.

Algorithms

Longest palindromic substring using Palindromic tree

Given a string, we are required to find the longest palindromic substring. In this article, we have solved this problem using palindromic tree.

Algorithms

Find the longest increasing subsequence using Fenwick Tree

You are given an array of length N. You have to find the longest increasing subsequence from the given array. We will try to solve this problem using Fenwick Tree which will take O(N logN) time complexity.

Data Structures

Binary Space Partitioning Trees

Binary Space Partitioning Trees is a method of recursively subdividing a space into two convex sets by using hyperplanes as partitions. The resulting data structure is a binary tree, and the two subplanes are referred to as front and back.

Data Structures

Applications of Trie Data Structure

In this article, we have explored the applications of Trie data structure which is an efficient data structure for handling strings. Some of the best applications of Trie are Auto complete, spell checker, longest prefix matching and browser history.

Data Structures

Space partitioning trees

Space partitioning trees are tree data structures that partition a N-dimensional data space into different components for specific tasks. Examples of Space partitioning trees include Binary Space Partitioning tree, Octree and many more.

Data Structures

Comparison of Bloom Filters with other data structures

In this article, we have compared Bloom filter with other data structures like Hash Map, Binary Search Trees and Trie along with general idea of using Bloom Filters.

Algorithms

Queue using Array

In this article, we have explored how to implement queue using array and explored various operations such as enqueue, dequeue, display, front and size. We have provided implementation in C and Python as well.

People in Computer Science

Hans Peter Luhn, the man behind Hash Map

Hans Peter Luhn was a computer scientist who is famously remembered as the inventor of Hash Map and has laid the foundations of text information processing.

Data Structures

Applications of Bloom Filter

We have explored the applications of Bloom Filter which includes weak password detection, use in Internet cache protocol, safe browsing in Google Chrome and much more.

Data Structures

Bloom Filter: Better than Hash Map

Bloom Filter is a probabilistic Data Structure that is used to determine whether an element is present in a given list of elements. It is quite fast in element searching.

Data Structures

Dynamic Array

Dynamic Array solves the problem of array where the size needs to fixed beforehand. On average, dynamic array achieves same performance as an array by using resize operation.

Software Engineering

Approaches for implementing Autocomplete Feature

The various approaches for Text Auto-completion are Linear Search (Brute Force), Binary Search Approach, TRIE Data Structure, Ternary Search Tree Approach, Fuzzy Search, Burkhard Keller Tree Approach and Machine Learning Approach.

Data Structures

Burkhard Keller Tree (BK Tree)

Burkhard Keller Tree (BK-Tree) is a Tree Data Structure that is used to find the near-matches to a String Query. It is used in several applications like spell correction and autocompletion.