Part 1: Your tasks for this assignment are the following:
1. Discuss the use of a binary tree when searching for keys in an array.
2. Discuss the use of a binary tree when searching for keys in a linked list.
Part 2: Complete the following program:
1. Describe a linked list structure to support binary searching.
2. Create pseudo code to describe a binary search with this linked list variation.
Deliverables:
- Summary of binary search with an array.
- Summary of binary search with a linked list.
- 1 fully documented pseudo code implementation of a linked list useful for binary searches.