Fenwick Tree (Binary Indexed Tree) Implementation in C++ A Fenwick Tree, also known as a Binary Indexed Tree (BIT), is a data structure […]
Tag: CPP
C++
AVL Tree Implementation in C++
AVL Tree Implementation in C++ An AVL tree is a self-balancing binary search tree where the difference in heights between the left and […]
C++
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 stores an extra bit for denoting […]
C++
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 efficient insertion, deletion, and search […]
C++
Suffix Array Implementation in C++
Suffix Array Implementation in C++ A Suffix Array is a data structure that provides a sorted array of all suffixes of a given […]
C++
Bloom Filter Implementation in C++
Bloom Filter Implementation in C++ A Bloom Filter is a probabilistic data structure used to test whether an element is a member of […]
C++
Disjoint Set Data Structure Implementation in C++
Disjoint Set Data Structure Implementation in C++ A Disjoint Set, also known as Union-Find, is a data structure that keeps track of a […]
C++
Detect Loop in Linked List – C++ Program
Loop Detection in a Linked List – C++ Program This program demonstrates how to detect a loop in a singly linked list using Floyd’s […]
C++
C++ Program to Reverse a Singly Linked List
Reverse a Singly Linked List in C++ This program demonstrates how to reverse a singly linked list in C++. The structure of the […]
C++
Longest Palindromic Substring in C++
Longest Palindromic Substring in C++ Program #include #include #include using namespace std; /** * Function to expand around the center and find the longest […]
