Invariant tests of sumtree

[ZenGround0]

Exercise many adds and removes on the sumtree and then assert the invariant that sumtree nodes are equal to the sum of 2^height of the base array.

[Hany-Almnaem]

Hi @rjan90, I’d like to take on this issue.

I plan to ensure core properties like sum(children) == parent, and to validate tree behavior under randomized insertions and deletions.

Please assign me if it’s okay to proceed.

[rjan90]

Awesome @Hany-Almnaem! I have assigned the issue to you, let us know if you have any questions with regards to this ticket. Either here, or in the #fil-pdp channel on Slack