Implement a BST file archiver. Your program should take a BST created in main memory using the implementation of Figure 5.14 and write it out to disk using one of the sequential representations of Section 6.5. It should also be able to read in disk files using your sequential representation and create the equivalent main memory representation.

Transcribed Image Text:

import java.lang. Comparable; /** Binary Search Tree implementation for Dictionary ADT */ class BST