JAVA

We can think of a BinaryTrie as a structure that stores bit strings of length w in such a way that each bitstring is represented as a root to leaf path. Extend this idea into an SSet implementation that stores variable-length strings and implements add(s), remove(s), and find(s) in time proporitional to the length of s.

Write a class and test it in Main. Explain the complexity of the operation

Hint: Each node in your data structure should store a hash table that is indexed by character values.