/StepByStepHeapTreePy

A step-by-step implementation of a heap-tree in Python. By this class you can easily convert an array to maxheap or minheap tree. Also you can extract the maximum or minimum value from the heap-tree. The heap-tree is a binary tree that can be used to sort an array of numbers. (both MaxHeap and MinHeap)

Primary LanguagePythonGNU General Public License v3.0GPL-3.0

Watchers