Problem
Considering the functionality of a Trie, pick two other data structures we have studied and discuss the following:
Segment Tree & Binary Search Tree
1) How efficient is the creation Trie vs Segment Tree vs Binary Search Tree
2) How good will that data structure (segment tree and binary search tree) be at the main look-up tasks of a Trie(search and begins_with).
3) How can each of the chosen data structures (segment tree and binary search tree) support the two look-up tasks (can you use the existing functionality or do you need to do something extra to what is typically returned?)