Write a recursive method(Code ) static void mirrorTree(node root) This will take a tree as input and then change the tree such that it becomes a mirror of itself. We have the following methods implemented(you can use them and assume we coded somewhere else): getLeft(), getRight(), setLeft(), setRight(), getValue(). All the values in a node are integers. [Hint: Use them, and think how you would write when the tree only has 2 children ] Example:

Please answer the question in the screenshot. The language used here is Java. Please use the starting code.

In python. Write a LinkedList class that has recursive implementations of the add and remove methods. It should also have recursive implementations of the contains, insert, and reverse methods. The reverse method should not change the data value each node holds - it must rearrange the order of the nodes in the linked list (by changing the next value each node holds). It should have a recursive method named to_plain_list that takes no parameters (unless they have default arguments) and returns a regular Python list that has the same values (from the data attribute of the Node objects), in the same order, as the current state of the linked list. The head data member of the LinkedList class must be private and have a get method defined (named get_head). It should return the first Node in the list (not the value inside it). As in the iterative LinkedList in the exploration, the data members of the Node class don't have to be private. The reason for that is because Node is a trivial class…

C. package Final;   import java.util.HashSet;   public class LLCycle_FE {     public static void main(String[] args) {         Node head = buildLL();        // Given the above linked list write the 2 methods below (removeDuplicates and showLL)         System.out.printf("\n --------- ");         // This method will remove any duplicate LL nodes (that is, with the same color)         head = removeDuplicates( head );         showLL( head );       }        **public static Node removeDuplicates(Node head) {           return head;     }      ** private static void showLL(Node head) {          // ToDo: Output the entire linked list     }       private static Node buildLL() {         // Use this code to create your LL         Node head = new Node("Red", null);           Node n2 = new Node("Blue", null);         head.next = n2;           Node n3 = new Node("Green", null);         n2.next = n3;           Node n4 = new Node("Yellow", null);         n3.next = n4;           Node n5 = new…