DATA STRUCTURES (ASSIGNMENT)PRACTICAL APPLICATIONS1) Binary Search Tree (BST)Binary Search Tree (BST) is a sorted or sorted binary tree. It has various applications, as the word itself explains its biggest usage i.e. search, BST is widely used in search applications and software where data goes in and out continuously, such as maps, set operations, search engines, vote and many others. The practical application I discuss today is the voting system. BST has wide use in voting systems. It is widely used in voting applications and systems due to its ordered data structure. The voting system is based on four phases, the first phase consists in the initialization of the technical part of the electoral system and the organizational structure, the second phase consists in the insertion of the ballot in which the votes are cast. In the third phase, voter validation is tested, i.e. the voter's information and whether his or her vote is valid or not. The fourth step is the tabulation process where the counters count the valid votes and give us the correct result. The voting system discussed above is based on the Binary Index Search Tree (IBST) which is an adaptive data structure and is composed of two parts, the indexing part and the binary search tree part. Indexing part: Contains information for each credential in the voting scheme. Each node of a tree is a pointer pointing to a binary search tree of fixed size. Since the size of the binary search tree is fixed and if the size of the voters increases, the indexing part will add a pointer to a new binary search tree. Part of Binary Search Tree: Contains Binary Search Tree constructed randomly from voter credentials with the same...... middle of paper ......A digital signature is an electronic system widely used in many organizations for employees, since this machine takes the signature of the person who signs it and then verifies it through its database that the signature placed by the person is valid or not, that is, whether he is an employee of the company or not. When an employee signs on the digital pad, their signature is recorded and a summary message is generated indicating whether that signature is correct or not. We use a private key previously obtained from the public-private key authority which is used to encrypt the hash. This encrypted hash becomes digital signature and then generates a message on the validation screen. Different algorithms are used to implement the hashing function in this digital signature machine such as DigitalSignature Algorithm (DSA), Elliptic Curve Digital Signature Algorithm (ECDSA) and RSA etc..