The document outlines two questions related to binary search trees. The first question asks for iterative implementations of search, insert, and delete operations in any programming language. The second question requests two applications or use cases for binary search trees, along with explanations of how these use cases utilize the data structure.

1. Question 1 - Implement binary search tree operations with
iterative solutions in any programming languages. : Search,
Insert, Delete
Question 2 - Find two applications/use cases of the binary
search tree and explain how the use cases (Applications) apply
the binary search tree.