Added Trie data structure in DSA

Data Structures and Algorithm (DSA)/readme.md

@@ -101,6 +101,10 @@ Let's make coding fun and exciting! 🚀.</td>
   <tr>
   <td><a href="https://youtu.be/bvWVs0tJUOY?si=49dbm82Ck8_V2E70"> Graph </a></td>
   <td> A Graph is a non-linear data structure consisting of a finite set of vertices(or nodes) and a set of edges that connect a pair of nodes. Another important non-linear data structure is the graph. It is similar to the Tree data structure, with the difference that there is no particular root or leaf node, and it can be traversed in any order. </td>
+  </tr>
+   <tr>
+  <td><a href="https://www.youtube.com/playlist?list=PLgUwDviBIf0pcIDCZnxhv0LkHf5KzG9zp"> Tries </a></td>
+  <td> A trie, or prefix tree, is a tree-like data structure used to store a dynamic set of strings. Each node represents a character of a string, enabling efficient retrieval, insertion, and search operations, often used for autocomplete and spell checking. </td>
   </tr>
   </table>