explore other implementations of binomial heaps

[make-github-pseudonymous-again]

1. use a backreference to keep track of nodes instead of swapping childrens
   • faster because we only need to swap values and backreferences
   • additional memory used
2. implementation only supporting push pop and merge

[make-github-pseudonymous-again]

migrated from make-github-pseudonymous-again/js-algorithms#14

[make-github-pseudonymous-again]

migrated from https://github.com/aureooms/js-data-structures/issues/4

[make-github-pseudonymous-again]

migrated from heap-data-structure/about#3