Java Think Binarytrie Structure Stores Bit Strings Length W Way Bitstring Represented Root Q43799421
JAVA
We can think of a BinaryTrie as a structure that stores bitstrings of length w in such a way that each bitstring isrepresented as a root to leaf path. Extend this idea into an SSetimplementation that stores variable-length strings and implementsadd(s), remove(s), and find(s) in time proporitional to the lengthof s.
Write a class and test it in Main. Explain thecomplexity of the operation
Hint: Each node in your data structure should store a hash tablethat is indexed by character values.
Expert Answer
Answer to JAVA We can think of a BinaryTrie as a structure that stores bit strings of length w in such a way that each bitstring i…
OR