Added Trie Data Structure #6787
Closed
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Jeevan-23
requested review from
DenizAltunkapan,
alxkm and
yanglbme
as code owners
Codecov Report❌ Patch coverage is
Additional details and impacted files@@ Coverage Diff @@
## update-directory #6787 +/- ##
======================================================
- Coverage 77.46% 77.35% -0.12%
- Complexity 6257 6258 +1
======================================================
Files 725 726 +1
Lines 20894 20923 +29
Branches 4071 4077 +6
======================================================
- Hits 16185 16184 -1
- Misses 4075 4105 +30
Partials 634 634 ☔ View full report in Codecov by Sentry. 🚀 New features to boost your workflow:
|
DenizAltunkapan
force-pushed
the
update-directory
branch
9 times, most recently
from
fd72704 to
63d7653
Compare
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
3 participants
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Summary:
Added a clean and efficient implementation of the Trie (Prefix Tree) data structure under com.thealgorithms.datastructures.tries.
Details:
Implements standard insert, search, and startsWith operations.
Uses an array-based node representation (TrieNode[26]) to efficiently handle lowercase English letters ('a'–'z').
Removed use of HashMap to comply with repository code quality rules and eliminate the DMC_DUBIOUS_MAP_COLLECTION warning.
Fully documented with Javadoc for readability and maintainability.
Complexity:
Insert: O(n)
Search: O(n)
Prefix check: O(n)
(where n is the length of the input string)
Testing:
Verified insertion, lookup, and prefix matching using sample words to ensure correctness and build stability.
clang-format -i --style=file path/to/your/file.java