Similar to a SumTree, if all you need is incrementally computed values without data persistence, a heap makes for a more efficient data structure. I remember le

Similar to a SumTree, if all you need is incrementally computed values without data persistence, a heap makes for a more efficient data structure. I remember learning about this from the following blog: https://timvieira.github.io/blog/post/2016/11/21/heaps-for-incremental-computation/ https://timvieira.github.io/blog/post/2016/11/21/heaps-for-i...