Tugas

Binary Search Tree is a binary tree based on nodes that has a certain attribute such as that the left node is smaller than its parents' node that the right node will always be bigger than its parents' node that both nodes must also be binary search tree and therefore cannot contains duplicates Above is an example of a Binary Search Tree Binary search tree can perform several operations such as: Searching, By comparing its roots to its nodes a program can climb through the node of a Binary search tree and find a specific node. by checking each root, comparing it to what it searched for climbing down to find the right node. sample code for searching in BST insertion, an operation to input certain data unto the Binary search tree on a specific node in the tree. by creating a space pushing the node and creating a new node either in the middle, the end or the beginning.  sample code of insertion in BST Deletion, an Operation that removes a node

Distributed Hash Table A DHT is solely a key-value store distributed across a variety of nodes in a very network. The keys are distributed among nodes with a settled rule. every node is to blame for a little of the hash table. A routing rule permits playing requests within the hash table while not knowing each node of the network. For example, within the Chord DHT —which is comparatively straightforward DHT implementation— every node is allotted Associate in Nursing symbol and is to blame for keys that are nearer to its identifier. Imagine there are four nodes that have identifiers: 'abc', 'def', 'ghi' , 'jkl' the information with the symbol 'abc' are going to behold on on the node 'abc'. Imagine currently that you just solely grasp the node def and you're searching for the information with the symbol 'mno' . You raise the node def for the information 'mno'. def doesn't have it, therefore, it asks the no