Im not sure I understand the transformation exactly,
assume we have a tree and each node has two pointers to a left and right child (and he has both childs)
How will a new node look after the transformation?
if he now has only a single hash=h(v1.data, v1.hash, v2.data, v2.hash), instead of both pointers, I dont understand how can any operation (like search for exmaple) can be implemented.
or does the hash comes as addition to having both pointers?