{"p":"can-20","op":"mint","tick":"can","amt":"1000","rows":[{"df":"qa","content":[{"q":"In a traditional Merkle Tree, how is the data updated each time?","a":"Update: First, update the data to  be replaced with new data.\n2. Recalculate: Update the height of the root node to reflect the new data. This usually involves recalculating the height of all nodes in the tree.\n3. Update leaf nodes: Based on the new height of the root node, update the content of all leaf nodes in the tree. This may involve recalculating the hash values in the leaf nodes.\n4. Update sibling nodes: Update the tree upwards based on the updates of the leaf nodes."}]}],"pr":"b3aab0396728fb030c41b22b2eaf4920861aff17f6c0129f7cf3d4e63e7e9df3"}