Open ZenGround0 opened 1 month ago
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.
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.