How do I implement the basic tree-rotation functions in java? Here are the rotation functions that I want to implement: L-rotation, R-rotation, LR-rotations, RR-rotations, LL-rotations and RL-rotations.  Use the given tree nodes as an example: TreeNode tr = new TreeNode();tr.root = new Node('A');tr.root.left = new Node('B');tr.root.right = new Node('Y');tr.root.left.left = new Node('N');tr.root.left.right = new Node('X');

Help in C++ please: Write a program (in main.cpp) that: Prompts the user for a filename containing node data. Outputs the minimal spanning tree for a given graph. You will need to implement the createSpanningGraph method in minimalSpanTreeType.h to create the graph and the weight matrix. There are a few tabs: main.cpp, graphType.h, linkedList.h, linkedQueue.h, queueADT.h, minimalSpanTreeType.h, and then two data files labeled: CH20_Ex21Data.txt, CH20Ex4Data.txt

In Python 3              You can create a more interesting and realistic-looking tree by randomizing the angle the turtle turns. Rather than always using a 30 degree angle, select an angle between 15 and 45 degrees. randomizing how much the branches shrink each time you make a recursive call. Instead of always subtracting 15, try subtracting a random amount between 5 and 25. add color to the tree by making the large branches brown, and the small branches green. Choose a threshold value (or use the existing value 5) for the length of the trunk and set the color accordingly. Here is a simple version that creates a "dot" in the base case (for a leaf). Your program output does not have to be the same. (Check picture)   import turtle def tree(t, trunkLength):if trunkLength < 5: #check for base casereturnelse:t.forward(trunkLength)t.right(30)tree(t, trunkLength - 15)t.left(60)tree(t, trunkLength - 15)t.right(30)t.backward(trunkLength) import turtlet =…

In Python 3             You can create a more interesting and realistic-looking tree by randomizing the angle the turtle turns. Rather than always using a 30 degree angle, select an angle between 15 and 45 degrees. randomizing how much the branches shrink each time you make a recursive call. Instead of always subtracting 15, try subtracting a random amount between 5 and 25. add color to the tree by making the large branches brown, and the small branches green. Choose a threshold value (or use the existing value 5) for the length of the trunk and set the color accordingly. Here is a simple version that creates a "dot" in the base case (for a leaf). Your program output does have to be similar.              Thank You.

This Java code does not run, it has some errors and it needs a main method, please fix it. import java.io.*; class DecisionTree { /* NESTED CLASS */ private class BinTree { /* FIELDS */ private int nodeID;private String questOrAns = null;private BinTree yesBranch = null;private BinTree noBranch = null; /* CONSTRUCTOR */ public BinTree(int newNodeID, String newQuestAns) {nodeID = newNodeID;questOrAns = newQuestAns;}} /* OTHER FIELDS */ static BufferedReader keyboardInput = newBufferedReader(new InputStreamReader(System.in));BinTree rootNode = null; /* Default Constructor */ public DecisionTree() {} /* CREATE ROOT NODE */ public void createRoot(int newNodeID, String newQuestAns) {rootNode = new BinTree(newNodeID,newQuestAns);System.out.println("Created root node " + newNodeID);} /* ADD YES NODE */ public void addYesNode(int existingNodeID, int newNodeID, String newQuestAns) {// If no root node do nothing if (rootNode == null) {System.out.println("ERROR: No root node!");return;} // Search…

Programming in Java. What would the difference be in the node classes for a singly linked list, doubly linked list, and a circular linked list? I attached the node classes I have for single and double, but I feel like I do not change enough? Also, I use identical classes for singular and circular node which does not feel right. Any help would be appreciated.

I am having trouble determining time complexity when it comes to finding the runtime of a method or function. I need to know what the runtime for the following methods are. Any further explanation would also be helpful. All of these methods are dealing with a binary search tree in java. 1. public String getAllValues() - return a String that contains the elementsof the tree in ascending order. All elements are separated by a space. 2. public int numberNodes() - return the total number of nodes in the tree. 3. public void insertList(int[] list) - insert all of the values from list intothe tree. Note: My Method just goes through an array calling working insert() method on all the values in the list[] array. 4. public int removeLessThan(int value) - this method removes all integers strictly less than value from the tree. It also returns the number of nodes itremoved. Note: In this method I first call a method to count nodes less than I call another method to recursively remove by…

What is the easiest way to fix a Node Constructor in my Java program? The current problem is it does not accept the Object being passed into it.

void traverse (Node node) { if(node.left!=null){ traverse (node.left); System.out.print (node.data+" ->"); } if (node.right!=null){ System.out.print (node.data+" ->"); traverse (node.right); Write the output that will be obtained when this traverse() method is called with the root of the tree given below. 8 4 12 2 6 10 14 1 3) 7 11 13 15

In Java,  Explain when it might be preferable to use a map instead of a set.