BOAWNE 1 struct Node 1 int data struct node* left: struct node right BE 6 unt operatori(Node root) { Node current root, while (current sright NULL) current current right 12 13 return (current data 14 NMSANNNNN 15 3 16 17 int operatore Node oot) 18 19 voia operator3(Node root) 21 [ 22 if (root--left - NULL && root->right -- NULL) { 23 operatorBroot left: operatorBCroot right); 20 26 else { delete root) } 28 29 } O The question is given below Buestion: Above is the partial implementation for the Binary Suureb Tree (BST) operulions, Explain what operator serves or in single sentence 2. Write the Ch + code for penular whose goal is to find the minimum data in a BST 3. The operators Function is supposed to delete all Ulu leaves in a BST correct the bugs in the code. Do pot re-write the function just state how you want to correct the mistakes in the code in a single sentence