Trie (Prefix Tree) Implementation in Go
Aditya Bhuyan Trie (Prefix Tree) Implementation in Go A Trie (pronounced “try”), also known as a prefix tree, is a tree-like data structure used to store a dynamic set of strings where…
August 2024
Autocomplete System Using Trie in Go
Autocomplete System Using Trie in Go A Trie (pronounced “try”) is a tree-like data structure that stores a dynamic set of strings, where the keys are usually strings. It is…
Segment Tree Implementation in Go
Segment Tree Implementation in Go A Segment Tree is a data structure that allows for efficient range queries and updates on an array. It is particularly useful when dealing with…
Fenwick Tree (Binary Indexed Tree) Implementation in Go
Fenwick Tree (Binary Indexed Tree) Implementation in Go 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 Go
AVL Tree Implementation in Go An AVL Tree is a self-balancing binary search tree where the difference in heights between the left and right subtrees (known as the balance factor)…
Red-Black Tree Implementation in Go
Red-Black Tree Implementation in Go A Red-Black Tree is a self-balancing binary search tree in which each node contains an extra bit for denoting the color of the node, either…
B-tree Implementation in Go
B-tree Implementation in Go 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 commonly used in…
Suffix Array Implementation in Go
Suffix Array Implementation in Go A suffix array is a data structure that provides a fast and memory-efficient way to perform substring searches in a string. It is an array…
Bloom Filter Implementation in Go
Bloom Filter Implementation in Go A Bloom filter is a space-efficient probabilistic data structure used to test whether an element is a member of a set. False positives are possible,…
Disjoint Set Data Structure in Go
Disjoint Set Data Structure in Go The disjoint set, also known as the union-find data structure, is used to keep track of a partition of a set into disjoint (non-overlapping)…
