g Recall that a pre-order traversal of a binary tree is one in which the value of the root of the tree is visited first, followed by the left subtree then the right subtree of the root. For instance, given the following binary tree: 10 / \ 8 12 / \ \ 2 9 15 a preorder traversal would visit the values in the following order: 10, 8, 2, 9, 12, 15 For this problem, start by constructing a binary search tree -- based on the un-balanced BST algorithms covered in class -- from the values 5, 2, 9, 6, 3, 8, 1 (from left to right). In what order are the values visited in a preorder traversal of the resulting tree

This program will store roster and rating information for a soccer team. coaches rate players during tryouts to ensure a balanced team. (1) prompt the user to input five pairs of numbers: a player's jersey number (0 - 99) and the player's rating (1 - 9). store the jersey numbers in one int vector and the ratings in another int vector. output these vectors (i.e., output the roster). (3 pts) ex: enter player 1's jersey number: 84 enter player 1's rating: 7 enter player 2's jersey number: 23 enter player 2's rating: 4 enter player 3's jersey number: 4 enter player 3's rating: 5 enter player 4's jersey number: 30 enter player 4's rating: 2

Read the code below. what will the computer print if the input for year_variable is 1700? if year_variable == 1776: print("your answer is correct. the declaration of independence was signed in “year_variable”.") elif year_variable < 1776: compute_variable = 1776 - year_variable. print("add “compute_variable“ years to your answer for the correct answer.") elif year_variable > 1776: compute_variable = year_variable - 1776 print("subtract “compute_variable” years from your answer for the correct answer.")

In a game with three frames, where will the objects on layer 1 appear? a. next to the play area b. in the middle of the game c. behind everything else d. in front of everything else