We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
The editorial assumes that if two subtrees hash to the same value, they are equal. While this may work for the given input data, it is a bad assumption in general. Disappointing. Especially since it is possible to check for such collisions within the time limits, given a careful implementation.
Editorial seems to be of no use. Can anyone given an elaborate explanation?
The editorial assumes that if two subtrees hash to the same value, they are equal. While this may work for the given input data, it is a bad assumption in general. Disappointing. Especially since it is possible to check for such collisions within the time limits, given a careful implementation.
The editorial is ill-written. Maybe the writer was in a hurry.
Can anyone discuss the solution in a better way? Thanks in advance!