Implement a collection of freelists for variable-length strings, as described at the end of Section 4.1.2. For each such freelist, you will need an access function to get it if it exists, and implement it if it does not. A major design consideration is how to organize the collection of freelists, which are distinguished by the length of the strings. Essentially, what is needed is a dictionary of freelists, organized by string lengths.
Figure 4.32 An array-based stack storing variable-length strings. Each position stores either one character or the length of the string immediately to the left of it in the stack.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here