Hashing ⭐Hash Functions A hash function maps input data (key) to a fixed-size numerical value (hash value). It is used to quickly access data in a hash table. ⭐Hash Table A hash table is a data structure that stores key-value pairs. It uses a hash f…
Graph | BFS | DFS | Warshall Algorithm | Floyd–Warshall Algorithm ⭐Breadth First Search(BFS) 1) BFS (matrix): CODE: #include <iostream> #include <queue> using namespace std; // Define a constant for the maximum number of vertices #define…
AVL Tree | Heap | B- Tree | B+ Tree ⭐AVL Tree A self-balancing binary search tree in which each node maintains extra information called a balance factor whose value is either -1 , 0 or +1 . Tree is said to be balanced if balance factor of each nod…
Our website uses cookies to improve your experience. Learn more
Ok