/Heap-Tree-Data-Structure

an O(1) time complexity of Heap algorithm without using an array

Primary LanguageJava

Heap-Tree-Data-Structure

Using purely Java object writing a poc Heap algorithm without using an array with an O(1) time complexity just like accessing an array element. Heap is always OlogN complexity when adding and removing.

heap screenshot

To compile: javac HeapTest.java

To run java HeapTest