Name: Ahmed IqbalRoll Number: 12k-2031Section: R1Practical Applications of:1. Binary Search Tree (BST) Binary search tree is used in many applications where information is always flowing in and out, for example, mapping and defining objects in many language libraries. Store a set of names, and you search for that based on the name prefix basically used in Internet routers. Storing a path in a graph and being able to invert any subsection of a path in O(log n) is fundamentally useful in traveling salesman problems. A binary search tree is the simplest algorithm for making efficient routes with many stops. Binary search tree is also the backbone of image recognition software to select objects or faces in a pixel image. In BST we can easily find an element in O(log n) times.2. B-TreesIf we take this from a practical point of view, B-Tree gives you the guarantee of less than 10ms access time even for extremely large datasets. The B-Tree gives some useful features: Transactions to automatically execute a few operations in one go. or several trees B. Where one...