Trie (Prefix Tree) Implementation in C
Aditya Bhuyan Trie (Prefix Tree) Implementation in C A Trie, also known as a prefix tree, is a tree data structure used for storing a dynamic set of strings, where the keys…
August 2024
Autocomplete System Using Trie in C
Autocomplete System Using Trie in C An autocomplete system is a feature commonly used in search engines, text editors, and other applications to predict and suggest possible completions for a…
Segment Tree Implementation in C
Segment Tree Implementation in C A Segment Tree is a powerful data structure used for answering range queries efficiently, such as sum, minimum, or maximum queries over a range of…
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 that provides efficient methods for cumulative frequency…
AVL Tree Implementation in C
AVL Tree Implementation in C 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…
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 has an extra bit for denoting the color of the node, either red…
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 for efficient insertion, deletion, and search operations. It is particularly useful in…
Suffix Array Implementation in C
Suffix Array Implementation in C A suffix array is a powerful data structure that is used for efficient substring searching in a given string. It is an array of all…
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 of a set. It can give false…
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 of elements partitioned into disjoint (non-overlapping) subsets.…
