0

I am trying to figure out how to properly navigate a hash tree structure given a certain transaction. I already have the answer to the question, but I'm not entirely sure how they arrived at it.

Here is a link to the hash tree structure

NOTE: BASICALLY I HAVE A HASH TREE AND NOW I WANT TO KNOW THAT WHICH LEAF NODES WILL BE CHECKED AGAINST THE TRANSACTION IF I HAVE A TRANSACTION WITH ME. HOW TO FIGURE THIS OUT??????????

Question: Given a transaction that contains items {1,3,4,5,8}, which of the hash tree leaf nodes will be visited when finding the candidates of the transaction?

Answer: L1, L3, L5, L9, and L11

I understand that this is some form of Apriori, so my initial thought process is to look at the first node level {1, 4, 7}, {2, 5, 8}, and {3, 6, 9} and if any of those 3 candidate itemsets contain at least 1 number in the transaction then proceed to the next node level, where you would check if at least 2 numbers were in the transaction, but that doesn't work at all. If anyone could help explain how to navigate this type of hash tree using a transaction it would be extremely helpful.

NOTE: BASICALLY I HAVE A HASH TREE AND NOW I WANT TO KNOW THAT WHICH LEAF NODES WILL BE CHECKED AGAINST THE TRANSACTION IF I HAVE A TRANSACTION WITH ME. HOW TO FIGURE THIS OUT??????????

1,4,7 3,6,9 2,5,8 1,4,7 3,6,9 1,4,7 3,6,9 2,5,8 1,4,7 2,5,8 3,6.9 2,5,8 L1 L5 L6 7 L8 L9 11 12 (145) 1178) (346) 356 (367) 1379)(689) (678) (1681246)1258 ( (278)289) 3,6,9 1,4,7/2,5,8 2 L3 4 (127) 125)459) (457 158)f456 1458) 789)