diff --git a/src/data-structures/tree/merkle-tree/README.md b/src/data-structures/tree/merkle-tree/README.md
new file mode 100644
index 00000000..a59ca5aa
--- /dev/null
+++ b/src/data-structures/tree/merkle-tree/README.md
@@ -0,0 +1,35 @@
+# Merkle - Tree
+
+_Read this in other languages:_
+
+## What Is a Merkle Tree?
+A Merkle tree is a data structure that is used in computer science applications. In bitcoin and other cryptocurrencies​, Merkle trees serve to encode blockchain data more efficiently and securely.
+
+Ralph C. Merkle (born February 2, 1952) is a computer scientist. He is one of the inventors of public key cryptography, the inventor of hashing. He is also the inventor of MERKEL tree.
+
+A Merkle tree is a hash-based data structure that is a generalization of the hash list. It is a tree structure in which each leaf node is a hash of a block of data, and each non-leaf node is a hash of its children. Typically, Merkle trees have a branching factor of 2, meaning that each node has up to 2 children.
+
+Merkle trees are used in distributed systems for efficient data verification. They are efficient because they use hashes instead of full files. Hashes are ways of encoding files that are much smaller than the actual file itself. Currently, their main uses are in peer-to-peer networks such as Tor, Bitcoin, and Git.
+
+![MerkleTree](https://upload.wikimedia.org/wikipedia/commons/thumb/9/95/Hash_Tree.svg/1920px-Hash_Tree.svg.png)
+
+## Usage 
+Merkle tree(Hash tree)  is used to verify any kind of data stored, handled and transferred in and between computers.
+
+Currently, the main use of Merkle tree is to make sure that data blocks received from other peers in a peer-to-peer network are received undamaged and unaltered, and even to check that the other peers do not lie and send fake blocks.
+
+Merkle tree is used in git, Amazon's Dynamo, Cassandra as well as BitCoin.
+
+## Role of Merkle Tree in Block Chain:
+
+Merkle Tree is one of the core data structures which is used in the Bitcoin blockchain to verify the existence of a transaction in a way that conserves both space and time quite effectively 
+
+Merkle trees produce an overall digital fingerprint of the entire set of transactions, providing a very efficient process to verify whether a transaction is included in a block.
+
+## Complexity
+ Merkle trees have very little overhead when compared with hash lists. Binary Merkle trees, like the one pictured above, operate similarly to binary search trees in that their depth is bounded by their branching factor, 2. Included below is worst-case analysis for a Merkle tree with a branching factor of kk.
+![MerkleTree](https://www.google.com/url?sa=i&url=https%3A%2F%2Fmedium.com%2F%40skj48817%2Fmerkle-trees-introduction-to-blockchain-c80c0247046&psig=AOvVaw3kakSbcvZ_Np71aiixWGfK&ust=1630408818280000&source=images&cd=vfe&ved=0CAsQjRxqFwoTCKi2p5nd2PICFQAAAAAdAAAAABAD)
+ 
+## References
+
+- [Wikipedia](https://en.wikipedia.org/wiki/Merkle_tree)
\ No newline at end of file
diff --git a/src/data-structures/tree/merkle-tree/complexity-merkle-tree.jpg b/src/data-structures/tree/merkle-tree/complexity-merkle-tree.jpg
new file mode 100644
index 00000000..d1534a92
Binary files /dev/null and b/src/data-structures/tree/merkle-tree/complexity-merkle-tree.jpg differ