AVL Tree Implementation in Bash This document explains how to implement a simplified AVL Tree using Bash. An AVL Tree is a self-balancing […]
Tag: SimpleProgram
Bash
Red-Black Tree Implementation in Bash
Red-Black Tree Implementation in Bash This document explains how to implement a simplified Red-Black Tree using Bash. A Red-Black Tree is a self-balancing […]
Bash
B-tree Implementation in Bash
B-tree Implementation in Bash This document explains how to implement a simplified B-tree using Bash. A B-tree is a self-balancing tree data structure […]
Bash
Suffix Array Implementation in Bash
Suffix Array Implementation in Bash This document explains how to implement a Suffix Array using Bash. A Suffix Array is a sorted array […]
Bash
Bloom Filter Implementation in Bash
Bloom Filter Implementation in Bash This document explains how to implement a Bloom Filter using Bash. A Bloom Filter is a space-efficient probabilistic […]
Bash
Disjoint Set Data Structure Implementation in Bash
Disjoint Set Data Structure Implementation in Bash This document explains the implementation of the Disjoint Set (Union-Find) data structure in Bash. The Disjoint […]
C
Trie (Prefix Tree) Implementation in C
Trie (Prefix Tree) Implementation in C A Trie, also known as a prefix tree, is a tree data structure used for storing a […]
C
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 […]
C
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, […]
C
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 […]
