If in two different positions, i and j, i < j, of a leaf in a bit-tree two D-bits are found such that Dj = Di, what is the condition on at least one of the D-bits Dk for i < k < j?
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.