<p><img src="https://cdn.hashnode.com/res/hashnode/image/upload/v1692684631336/56f5603e-28a2-4691-80d0-246c445f0197.png" alt class="image--center mx-auto" /></p>
<h3 id="heading-what-kind-of-data-structure-is-a-merkle-tree"><strong>What kind of data structure is a Merkle Tree?</strong></h3>
<ul>
<li>Tree</li>
</ul>
<h3 id="heading-how-is-each-leaf-node-labeled-in-merkle-tree"><strong>How is each leaf node labeled in Merkle Tree?</strong></h3>
<ul>
<li>A cryptographic hash of the data block</li>
</ul>
<h3 id="heading-how-is-each-non-leaf-node-labeled-in-merkle-tree"><strong>How is each non-leaf node labeled in Merkle Tree?</strong></h3>
<ul>
<li>A cryptographic hash of its child nodes’ values</li>
</ul>
<h3 id="heading-in-the-above-image-what-will-be-the-label-of-parent-node-for-c-and-d-leaf-nodes-in-case-of-merkle-trees"><strong>In the above image, what will be the label of parent node for C and D leaf nodes, in case of Merkle Trees?</strong></h3>
<ul>
<li>Hash CD</li>
</ul>
<h3 id="heading-if-node-d-is-replaced-with-node-e-what-will-be-the-label-of-the-parent-node-now"><strong>If node D is replaced with node E, what will be the label of the parent node now?</strong></h3>
<ul>
<li>Hash CE — it will change</li>
</ul>
<h3 id="heading-can-the-same-data-give-two-different-hashes-in-a-merkle-tree"><strong>Can the same data give two different hashes in a Merkle Tree?</strong></h3>
<ul>
<li>No</li>
</ul>
<h3 id="heading-which-one-of-the-following-is-not-a-property-of-a-hash-function"><strong>Which one of the following is not a property of a hash function?</strong></h3>
<ul>
<li>Can be reverse engineered</li>
</ul>
<h3 id="heading-which-one-of-the-following-is-not-a-benefit-of-using-a-merkle-tree"><strong>Which one of the following is not a benefit of using a Merkle Tree?</strong></h3>
<ul>
<li>Data is stored sequentially</li>
</ul>
<h3 id="heading-where-are-merkle-trees-not-used"><strong>Where are Merkle Trees not used?</strong></h3>
<ul>
<li>SQL Databases</li>
</ul>
<h3 id="heading-how-does-a-merkle-proof-work"><strong>How does a merkle proof work?</strong></h3>
<ul>
<li>We give the verifier the value of the node we want to check along with all other nodes which are required from the tree to hash up and form the root hash r.</li>
</ul>


![](https://cdn.hashnode.com/res/hashnode/image/upload/v1692684631336/56f5603e-28a2-4691-80d0-246c445f0197.png align="center")

### **What kind of data structure is a Merkle Tree?**

* Tree
    

### **How is each leaf node labeled in Merkle Tree?**

* A cryptographic hash of the data block
    

### **How is each non-leaf node labeled in Merkle Tree?**

* A cryptographic hash of its child nodes’ values
    

### **In the above image, what will be the label of parent node for C and D leaf nodes, in case of Merkle Trees?**

* Hash CD
    

### **If node D is replaced with node E, what will be the label of the parent node now?**

* Hash CE — it will change
    

### **Can the same data give two different hashes in a Merkle Tree?**

* No
    

### **Which one of the following is not a property of a hash function?**

* Can be reverse engineered
    

### **Which one of the following is not a benefit of using a Merkle Tree?**

* Data is stored sequentially
    

### **Where are Merkle Trees not used?**

* SQL Databases
    

### **How does a merkle proof work?**

* We give the verifier the value of the node we want to check along with all other nodes which are required from the tree to hash up and form the root hash r.

How to create Merkle Trees for airdrops: Quiz Solution

🔒 Cybersecurity Analyst | Network Specialist | Blockchain Enthusiast 🌟 | FAST Grad | Google & IBM Certified


🔒 Cybersecurity Analyst | Network Specialist | Blockchain Enthusiast 🌟 | FAST Grad | Google &amp; IBM Certified
