Name: Ahmed Iqbal Roll No: 12k-2031Section: R1Practical Applications of:1. Binary Search Tree (BST) The binary search tree is used in many applications where information flows in and out continuously, for example, mapping and setting objects in many language libraries. Memorize a series of names and search for them based on the name prefix used basically in Internet routers. Storing a path in a graph and being able to reverse 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. The binary search tree is also the backbone of image recognition software for selecting objects or faces from a pixel image. In BST we can easily find an element in O(log n) times. B-TreesIf we take this from a practical point of view, B-Tree gives you the guarantee of an access time of less than 10 ms even for extremely large datasets. The B-Tree offers some useful features: Transactions for automatically performing multiple operations in one or more B-trees. Where to...