data_structures Directory Reference

Directories
	cll

Files
	avltree.cpp
	A simple tree implementation using nodes.
	binary_search_tree.cpp
	A simple tree implementation using structured nodes.
	binary_search_tree2.cpp
	A generic binary search tree implementation. Here you can find more information about the algorithm: Scaler - Binary Search tree.
	binaryheap.cpp
	A C++ program to demonstrate common Binary Heap Operations.
	bloom_filter.cpp
	Bloom Filter generic implementation in C++
	disjoint_set.cpp
	Disjoint Sets Data Structure (Disjoint Sets)
	dsu_path_compression.cpp
	DSU (Disjoint sets)
	dsu_union_rank.cpp
	DSU (Disjoint sets)
	linked_list.cpp
	Implementation of singly linked list algorithm.
	linkedlist_implentation_usingarray.cpp
	Linked list implementation using Arrays.
	list_array.cpp
	Dynamic Array
	node.hpp
	Provides Node class and related utilities.
	queue.hpp
	queue_using_array.cpp
	Implementation of Linear [Queue using array] (https://www.geeksforgeeks.org/array-implementation-of-queue-simple/).
	queue_using_two_stacks.cpp
	reverse_a_linked_list.cpp
	Implementation of Reversing a single linked list
	segment_tree.cpp
	A data structure to quickly do operations on ranges: the Segment Tree algorithm implementation.
	skip_list.cpp
	Data structure for fast searching and insertion in \(O(\log n)\) time.
	sparse_table.cpp
	Implementation of Sparse Table for min() function.
	stack.hpp
	This class specifies the basic operation on a stack as a linked list.
	treap.cpp
	A balanced binary search tree (BST) on the basis of binary search tree and heap: the Treap algorithm implementation.
	tree_234.cpp
	A demo 2-3-4 tree implementation.
	trie_modern.cpp
	A basic implementation of trie class to store only lower-case strings.
	trie_tree.cpp
	Implementation of Trie data structure for English alphabets in small characters.
	trie_using_hashmap.cpp
	Implementation of Trie data structure using HashMap for different characters and method for predicting words based on prefix.