Collection Tree Protocol not use periodic beaconing to measure link quality?

a) List the balance factor for each Node in the BST. b) is the BST balanced or not? Why? 10 4 16 3 5

Explore a specific way to delete the root node ofthe Binary Search Tree (BST) while maintaining the Binary Search Tree(BST) property after deletion.Implementation will be as stated below:[1] Delete the root node value of the BST and replace the root value withthe appropriate value of the existing BST .[2] Perform the BST status check by doing an In-Order Traversal of theBST such that even after deletion the BST is maintained.# Class to represent Tree nodeclass Node:# A function to create a new nodedef __init__(self, key):self.data = keyself.left = Noneself.right = NoneThe root element of the Binary Search Tree is given to you. Below is an illustrated sample of Binary Search Tree nodes for your reference, which in-fact isthe same example we discussed in the lecture.root = Node(4)root.left = Node(2)root.right = Node(6)root.left.left = Node(1)root.left.right = Node(3)root.right.left = Node(5)root.right.right = Node(7)Delete the root node value provided and replace the root valuewith…

You are going to simulate the operation of an AVL tree on paper. For the purposes of this assignment, assume that new returns addresses in the following order: @1480 @1120 @1096 @1264 @1180 @1192 @1768 @1804 @1228 @1372 @1312 @1276 @1168 @1696 @1084 @1504 @1468 @1216 @1384 @1204 @1648 @1024 @1108 @1396 @1144 @1432 @1252 @1348 @1564 @1072 @1684 @1540 @1672 @1624 @1420 @1588 @1300 @1792 @1060 @1720 @1336 @1612 @1552 @1324 @1636 @1660 @1288 @1708 @1732 @1492 @1780 @1528 @1156 @1444 @1036 @1456 @1240 @1576 @1516 @1756 @1360 @1132 @1408 @1600 @1744 @1048 Also note that if you remove all references to an address (so it is garbage collected), it goes to the back of the queue (so would be after whatever is the last address in the AVL at that time). For delete() of a node with two children, I want you to assume that we replace the data (but not the node itself) with the successor value (and that the successor is removed and garbage collected). There are no duplicates allowed, so if there's a…