Trie (Prefix Tree) Implementation in Python
Aditya Bhuyan Trie (Prefix Tree) Implementation in Python Trie (Prefix Tree) Implementation in Python A Trie, also known as a prefix tree, is a tree-like data structure that is used to store…
August 2024
Autocomplete System Using Trie in Python
Autocomplete System Using Trie in Python Autocomplete System Using Trie in Python An autocomplete system is a feature that suggests possible completions for a given prefix based on previously entered…
Segment Tree Implementation in Python
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…
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…
Suffix Array Implementation in Python
Suffix Array Implementation in Python Suffix Array Implementation in Python A suffix array is a sorted array of all suffixes of a given string. It is a powerful tool for…
Bloom Filter Implementation in Python
Bloom Filter Implementation in Python Bloom Filter Implementation in Python A Bloom filter is a space-efficient probabilistic data structure used to test whether an element is a member of a…
Disjoint Set Data Structure Implementation in Python
Disjoint Set Data Structure Implementation in Python Disjoint Set Data Structure Implementation in Python A disjoint set data structure, also known as a union-find data structure, is used to keep…
