Segment Tree Implementation in Python
Aditya Bhuyan Segment Tree Implementation in Python Segment Tree Implementation in Python A Segment Tree is a data structure that allows efficient processing of range queries and updates on an array. It…
DataStructures
Fenwick Tree (Binary Indexed Tree) Implementation in Python
Fenwick Tree (Binary Indexed Tree) Implementation in Python Fenwick Tree (Binary Indexed Tree) Implementation in Python A Fenwick Tree, also known as a Binary Indexed Tree (BIT), is a data…
AVL Tree Implementation in Python
AVL Tree Implementation in Python AVL Tree Implementation in Python An AVL tree is a self-balancing binary search tree where the difference between heights of left and right subtrees (the…
Red-Black Tree Implementation in Python
Red-Black Tree Implementation in Python Red-Black Tree Implementation in Python A red-black tree is a self-balancing binary search tree where each node stores an extra bit representing “color” (“red” or…
B-tree Implementation in Python
B-tree Implementation in Python B-tree Implementation in Python A B-tree is a self-balancing tree data structure that maintains sorted data and allows for efficient insertion, deletion, and search operations. It…
Disjoint Set Data Structure Implementation in Java
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)…
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…
