Heap Tree in Data Structure
A Heap Tree is a Complete Binary Tree and follows the Heap property. It always keeps either minimum or maximum values on...
Category: Data Structures
Splay Tree in Data Structure
A Splay Tree is a roughly balanced Binary Search Tree (BST) that always keeps the recently accessed items closer to the ...
AVL Tree in Data Structure
AVL Tree is a self-balanced Binary Search Tree (BST) that maintains the optimal height of the tree. This ensures that th...
Binary Search Tree in Data Structure
A Binary Search Tree is a Binary Tree that contains the nodes sorted in a particular order. The ordering helps to perfor...
Binary Tree in Data Structure
A Binary Tree is a form of Tree Data Structure with almost two children for every node. This is required to store the da...
Tree Data Structure: Types and Applications
A tree is a non-linear data structure that is used to store the data in a hierarchical form. The data will be maintained...
Hash Table Implementation using Linear Probing in C++
Linear Probing is the simplest approach to handle the collisions in Hash Table. For instance, if the hash index is alrea...
Hash Table Implementation using Separate Chaining in C++
The Separate Chaining method is the preferred choice for Hash Table implementation when the input data is dynamic. For i...
Hash Table in Data Structure
Hash Table is a data structure that stores key-value pairs in an Array. A hash function is used to determine the array i...
Deque Implementation using Doubly Linked List
Doubly Linked List implementation can be the preferred choice for Deque when the input data is dynamic and expected to g...