Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal Jurnal Riset Multidisiplin Edukasi
Edison Pardengganan Siahaan
Unknown Affiliation
Other

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Penggabungan Sifat Binary Min Heap dan Max Heap pada Struktur Data Min-Max Heap dan Max-Min Heap: Konsep dan Visualisasi Edison Pardengganan Siahaan
Jurnal Riset Multidisiplin Edukasi Vol. 3 No. 1 (2026): Jurnal Riset Multidisiplin Edukasi (Januari 2026) In Press
Publisher : PT. Hasba Edukasi Mandiri

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.71282/jurmie.v3i1.1579

Abstract

This paper outlines the organizational mechanisms of two variants of the Binary Heap data structure, namely the Binary Min-Max Heap and the Binary Max-Min Heap. These variants are derived from a combination of characteristics found in the Binary Min Heap and Binary Max Heap, allowing users to efficiently retrieve both minimum and maximum values from a collection of stored and organized data. In addition to discussing the conceptual and operational aspects of these structures, the paper also presents the design of a software tool developed to visualize the organization process, particularly the procedures for inserting new nodes and deleting existing nodes from the data structures. The visualization is represented through a class diagram, which illustrates the internal structure of the program, including the attributes and methods involved in its implementation. This design aims to assist users in gaining a more intuitive understanding of the internal workings of both Binary Heap variants.
Co-Authors