Cryptography, Hashing, Learning, Data Structures, Merkle Tree.
security. In this particular application, a non-collision-resistant hashing function would break the algorithm completely. Firstly, this is a clear example that not every hashing function is suitable for every application. And secondly, the security of any scheme or protocol we can think of will be