Suffix Array Implementation in C A suffix array is a powerful data structure that is used for efficient substring searching in a given […]
Author: Aditya Bhuyan
C
Bloom Filter Implementation in C
Bloom Filter Implementation in C A Bloom filter is a space-efficient probabilistic data structure used to test whether an element is a member […]
C
Disjoint Set Data Structure in C
Disjoint Set Data Structure in C The Disjoint Set, also known as Union-Find, is a data structure that keeps track of a set […]
C++
Trie (Prefix Tree) Implementation in C++
Trie (Prefix Tree) Implementation in C++ A Trie (pronounced as “try”) is a tree-like data structure used to store a dynamic set of […]
C++
Autocomplete System using Trie in C++
Autocomplete System using Trie in C++ An autocomplete system predicts the completion of a word as a user types. This system can be […]
C++
Segment Tree Implementation in C++
Segment Tree Implementation in C++ A Segment Tree is a data structure that allows efficient processing of range queries and updates on an […]
C++
Fenwick Tree (Binary Indexed Tree) Implementation in C++
Fenwick Tree (Binary Indexed Tree) Implementation in C++ A Fenwick Tree, also known as a Binary Indexed Tree (BIT), is a data structure […]
C++
AVL Tree Implementation in C++
AVL Tree Implementation in C++ An AVL tree is a self-balancing binary search tree where the difference in heights between the left and […]
C++
Red-Black Tree Implementation in C++
Red-Black Tree Implementation in C++ A Red-Black Tree is a self-balancing binary search tree where each node stores an extra bit for denoting […]
C++
B-tree Implementation in C++
B-tree Implementation in C++ A B-tree is a self-balancing tree data structure that maintains sorted data and allows efficient insertion, deletion, and search […]
