Includes custom comparator to easily make a min or max heap
Further Information and Comments
Reconstructs the nary_tree object on every change to the tree. This is inefficient, but insert_node messes up the tree, and I couldn't find a way to change the value of nodes, which is necessary for swapping values during heapify.
Reviewer Checklist
[ ] The PR title is descriptive enough for the changelog, and the PR is labeled correctly
[ ] If applicable: newly added code segments are adequately covered by tests
[ ] If applicable: newly added non-private functions and classes have a docstring including a short summary and a PARAMETERS section
Fix issue #16
Overview: What does this pull request change?
Further Information and Comments
Reviewer Checklist