Binary Search Tree from Hash Table?
So I am told to create a "Forest of Binary Search Trees" from a hash table. But am a bit confused on how to go about it. What am thinking is just flipping through the Hash table and add them to a Binary Search Tree. But that would only make one tree, and not a forest. Or is the idea to create trees out of the buckets inside the hash table?
Topic archived. No new replies allowed.