2) Binary Search Tree - Tracing The following code recurses over a Binary Search Tree (BST) and prints to standard out occasionally. Please trace through the code for the given BST and write what would be printed out after the code terminates. Do not write the return value of the method. Just write each print statement's output on a new line. Ensure that the print statements' outputs are correct and in the correct order. The method is run on the root of the BST. public class Node { public T data; public Node left; public Node right; } public int mystery Rec (Node current) { if (current == null) { return 0; } } 5 int left mystery Rec (current.left); int right = mysteryRec (current.right); int tmp = left + current.data + right; if (tmp> 15) { Input BST: System.out.println(current.data); } return tmp; 10 20 30 50 70 Output: llun

Please help me with this using java and recursion. Please also comment the code. Please do not use hashtags when creating theses fractals. And provide an image of the output.  (Just pick one) 1) create a sierpenski triangle fract   2) create a viscek fractals

JAVA

Please dont copy and paste previous solutions. I checked them they are wrong.

Fill-In Blanks of the following question: At the end of every iteration of gets at the end of the list. Answer: sort the heaviest element

Quick Sort We choose an element from the list, called the pivot. We'll use it to divide the list into two sub-lists. We reorder all the elements around the pivot The ones with smaller value are placed before it All the elements greater than the pivot after it. After this step, the pivot is in its final position. This is the important partition step. We apply the above steps recursively to both sub-lists on the left and right of the pivot.   Quick Sort (Example) Consider the following array Arr[] = {5, 9, 4, 6, 5, 3} Let's suppose we pick 5 as the pivot for simplicity We'll first put all elements less than 5 in the first position of the array: {3, 4, 5, 6, 5, 9} We'll then repeat it for the left sub-array {3,4}, taking 3 as the pivot There are no elements less than 3 We apply quicksort on the sub-array in the right of the pivot, i.e. {4} This sub-array consists of only one sorted element We continue with the right part of the original array, {6, 5, 9} until we get the final ordered…

Write a version of the binary search algorithm that can be used to search a list of strings. (Use the selection sort that you designed to sort the list.)

def findOccurrences(s, ch):     lst = []     for i in range(0, len(s)):         if a==s[i]:             lst.append(i)     return lst Use the code above instead of enumerate in the code posted below. n=int(input("Number of rounds of Hangman to be played:")) for i in range(0,n):     word = input("welcome!")     guesses = ''     turns = int(input("Enter the number of failed attempts allowed:")) def hangman(word):            secrete_word = "-" * len(word)     print(" the secrete word " + secrete_word)         user_input = input("Guess a letter: ")         if user_input in word:         occurences = findOccurrences(word, user_input)         for index in occurences:             secrete_word = secrete_word[:index] + user_input + secrete_word[index + 1:]         print(secrete_word)     else:         user_input = input("Sorry that letter was not found, please try again: ")   def findOccurrences(s, ch):     return [i for i, letter in enumerate(s) if letter == ch]  *** enumerate not discussed in…

Can you help me with a C++ programming task I am trying to complete for myself 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