Knowledge in Special Type of Trees

HEAP SORT (TREES)

This file contains the algorithms of Heap Sort.The Heap sort algorithm is widely used because of its efficiency. Heap sort works by transforming the list of items to be sorted into a heap data structure, a binary tree with heap properties. In a binary tree, every node has, at most, two descendants.This was prepared by experts which is very much important to all categories of students want to learn this concept.Having a overview makes everyone to understand the concept.