mem-c is a simple memory allocator using a heap data structure with the mmap Linux syscall for dynamic memory management. It has a worst-case search time of O(log n) . The allocator supports memory pagination, chunk merging, and plans for advanced features like garbage collection and arenas.
Reduces number of transactions,implementeda feature of Splitwise using Heap Data Struture
A heap is a specialized tree-based data structure which is essentially an almost complete tree that satisfies the heap property: in a max heap, for any given node C, if P is a parent node of C, then the key (the value) of P is greater than or equal to the key of C. In a min-heap, the key of P is less than or equal to the key of C. The node at th…
A Course for learning Advanced Data Structures Algorithms.
This program performs data compression using the Huffman encoding algorithm.
Java implementation of MaxHeap and MinHeap data structures with sorting functionalities. The program prompts the user to input the number of nodes and their values, constructs both max and min heaps, and performs sorting to obtain ascending and descending order sorted arrays, respectively.
To associate your repository with the heap-data-struture topic, visit your repo's landing page and select "manage topics."