Data Structure
Hashing has the fundamental problem of collision, two or more keys could have same hashes leading to the collision. Open addressing also called as Close hashing is the
Read More Data Structure
A heap is a tree based data structure that follows, It’s a complete tree , all the levels are completely filled except possibly the last level where all
Read More