Answer:
article, website run by non profit, website for fed agency
Answer:
b. Binary tree
Explanation:
The time complexity of a binary tree is O(log n). As it scales up in size (n), the time taken is only log n. This is because it makes use of divide and conquer to split up the data which makes searching and inserting very simple. However, this only holds if the data is already sorted.
