Disjoint Set Data Structure Implementation in Java
Aditya Bhuyan Disjoint Set Data Structure Implementation in Java A Disjoint Set (also known as Union-Find) is a data structure that keeps track of a partition of a set into disjoint (non-overlapping)…
August 2024
Bloom Filter Implementation in Java for Probabilistic Set Membership
Bloom Filter Implementation in Java for Probabilistic Set Membership A Bloom filter is a probabilistic data structure that is used to test whether an element is a member of a…
Suffix Array Implementation in Java for Substring Search
Suffix Array Implementation in Java for Substring Search A suffix array is a data structure that provides an efficient way to search for substrings within a string. It consists of…
B-Tree Implementation in Java for Database Indexing
B-Tree Implementation in Java for Database Indexing A B-Tree is a self-balancing tree data structure that maintains sorted data and allows for efficient insertion, deletion, and search operations. B-Trees are…
Red-Black Tree Implementation in Java
Red-Black Tree Implementation in Java A Red-Black Tree is a self-balancing binary search tree where each node contains an extra bit for denoting the color of the node, either red…
AVL Tree Implementation in Java
AVL Tree Implementation in Java An AVL tree is a self-balancing binary search tree where the difference between the heights of the left and right subtrees cannot be more than…
Fenwick Tree (Binary Indexed Tree) Implementation in Java
Fenwick Tree (Binary Indexed Tree) Implementation in Java A Fenwick Tree, also known as a Binary Indexed Tree (BIT), is a data structure that provides efficient methods for calculating and…
Segment Tree Implementation in Java
Segment Tree Implementation in Java A segment tree is a versatile data structure that is primarily used for answering range queries over an array, such as finding the sum, minimum,…
Autocomplete System Using Trie in Java
Autocomplete System Using Trie in Java An autocomplete system predicts the completion of a word being typed by the user. A Trie (prefix tree) is an efficient data structure for…
Trie (Prefix Tree) Implementation in Java
Trie (Prefix Tree) Implementation in Java A Trie, also known as a prefix tree, is a tree-like data structure that is used to store a dynamic set of strings, where…
