Created as a school project with Python 3.6 and Tkinter. The code is in no means clean or even any good. It was my first ever programming project and I used it to learn basic concepts back in 2018/19.

A python implementation of max-min heap. A max-min heap is an almost complete binary tree, in which each node at even depth is bigger than (or equal to) every children of his, and each node at odd ...