Comparative Study of 2-heap, Skew-Heap and Ternary heap

Abstract

Generally, Heap is an organization of Data/Key values in system which is based on tree data structure which follows a particular order to make it Max-heap or Min-heap. Heaps are useful in Priority Scheduling Algorithms, Sorting (Heap sort), Path Selection (Dijkstra algorithm) etc. Searching Minimum and Maximum key is very easy in heap as compared to other data structures. Heaps are derived from the terminology of Binary tree. Useful variations of heaps are 2-Heap, Ternary Heap and Skew Heaps. These can be Compared on the basis of their Applications, Structural differences, Operations and their Space/Time Complexity. Heaps are also fully supported by Some High level languages such as C++ Standard Template Library (STL). In Real world scenario, Heap can be related with an Organization where an owner or top ranked person stands first as root in heap. All the descendents (children nodes) follow the Decisions made by the person above them (roots)