chore: Version bump (#22)

Co-authored-by: Kirill Polishchuk <kirill.polishchuk@iag.co.nz>

src/KTrie/KTrie.csproj

@@ -4,7 +4,7 @@
     <Authors>Kirill Polishchuk</Authors>
     <Description>Trie (a.k.a. prefix tree) is an ordered tree data structure that is used to store an associative array where the keys are usually strings. All the descendants of a node have a common prefix of the string associated with that node, and the root is associated with the empty string.</Description>
     <Copyright>Kirill Polishchuk</Copyright>
-    <Version>2.4.1</Version>
+    <Version>2.5.0</Version>
     <RepositoryUrl>https://github.com/kpol/trie</RepositoryUrl>
     <PackageProjectUrl>https://github.com/kpol/trie</PackageProjectUrl>
     <PackageTags>trie, prefix-tree, data-structure</PackageTags>