GitHub / BaseMax / 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)
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaseMax%2FStepByStepHeapTreePy
PURL: pkg:github/BaseMax/StepByStepHeapTreePy
Stars: 0
Forks: 0
Open issues: 0
License: gpl-3.0
Language: Python
Size: 17.6 KB
Dependencies parsed at: Pending
Created at: over 2 years ago
Updated at: over 2 years ago
Pushed at: over 2 years ago
Last synced at: 13 days ago
Topics: heap-tree, heaptree, maxheap, minhrap, py, python, tree, tree-heap
Funding Links https://github.com/sponsors/BaseMax