root
/ \
A B
/ \ / \
t1 t2 t3 t4
A=hash(t1,t2)
B=hash(t3,t4)
Root=hash(A,B)
presented above is the typical merkle tree algorithm, but seems the merkle tree algorithm in bitshares toolkit is simplified as below(if i my understanding is not wrong),what is the purpose?is it still work properly after simplified ?and any benefit from the simplification?
A=hash(t2)
B=hash(t4)
Root=hash(B)