i11) Given an array Arr: {4, 12, 10, 5, 11, 8, 7, 6, 9}. If it is put in a BST in the same order, what will be the height of the nodes given - 4,5,6.iv) Given a BST, print the maximum node first then the minimum then the second maximum then the second minimum and so on. Writean 'efficient' algorithm to print BST in the above-mentioned order.

As per our company guidelines we are supposed to answer only one question per post and kindly…

Answered: 111) Given an array Arr: {4, 12, 10, 5,…

111) Given an array Arr: {4, 12, 10, 5, 11, 8, 7, 6, 9}. If it is put in a BST in the same order, what will be the height of the nodes given 4. 5, 6.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter7: Arrays

Section: Chapter Questions

Problem 3PP: (Numerical) Given a one-dimensional array of integer numbers, write and test a function that...

See similar textbooks

Similar questions

Write a function that returns trueif the product of an array is divisible by the sum of that same array. Otherwise, return false. Example: divisible([3, 2, 4, 2]) →false WRITE IN PYTHON PLEASE
VelTech Codeathon Jan Finals Test will be Lowest Common Multiple (LCM) You are given an array of positive integers, arr, of size array length. You are asked to build set S which consists of the LCM of every pair of adjacent elements in arr. Your task is to find the largest element in set S For example, for the array (1, 2, 3, 4), set S = { Icm(1,2), Icrm(2,3), Icrm(3,4) } = (2, 6, 12). The largest element is Fill you 12 Notes The array contains only positive integers. Adjacent elements may NOT be circular, ie. they may not wrap around the end of the array Definition of LCM A multiple of a number, num, is a number that can be divided by num. For example, the multiples of 5 are 5, 10, 15, 20, 25, and so on, The lowest common multiple (LCM) of two numbers, a and b, is the smallest positive number that is a multiple of both a and b Example 1 Input 4 1324 Output 9. Explanation set S= (lcm(1, 3), Icm(3, 2), Icm(2, 4) ) = (3, 6, 4) Largest element 6 Example 2 Pro Input 7329 12 Output 36…
1r. ""Implementation of the Misra-Gries algorithm.Given a list of items and a value k, it returns the every item in the listthat appears at least n/k times, where n is the length of the array By default, k is set to 2, solving the majority problem. For the majority problem, this algorithm only guarantees that if there isan element that appears more than n/2 times, it will be outputed. If thereis no such element, any arbitrary element is returned by the algorithm.Therefore, we need to iterate through again at the end. But since we have filtredout the suspects, the memory complexity is significantly lower thanit would be to create counter for every element in the list. For example:Input misras_gries([1,4,4,4,5,4,4])Output {'4':5}Input misras_gries([0,0,0,1,1,1,1])Output {'1':4}Input misras_gries([0,0,0,0,1,1,1,2,2],3)Output {'0':4,'1':3}Input misras_gries([0,0,0,1,1,1]Output None""".
c++
In main() for now: do these - one at a time, each in it's own loop (we will make functions out of them later –Declare an array RandArray with 20 integers –Assign each of the 20 values with a random value from 0 to 99 Hint: Use rand()%100 For mimir: Do not call srand at the top of main. // normally: Call srand(time(0)) at the top of main –(you need #include<cstdlib>) –Write another loop that prints the array, with index values Important: If the output values do not match mimir, please add srand(17); // inside your main function - at the top code format: #include <iostream>using namespace std; #include <cstdlib> // required for rand() int main(){ srand(17); // define a constant ARRAYSIZE that is 20 // declare randArray // set the 20 elements in randArray to be a random number between 0 and 99 // hint: use rand()%100 // print the 20 values return 0;}
1.""Implementation of the Misra-Gries algorithm.Given a list of items and a value k, it returns the every item in the listthat appears at least n/k times, where n is the length of the array By default, k is set to 2, solving the majority problem. For the majority problem, this algorithm only guarantees that if there isan element that appears more than n/2 times, it will be outputed. If thereis no such element, any arbitrary element is returned by the algorithm.Therefore, we need to iterate through again at the end. But since we have filtredout the suspects, the memory complexity is significantly lower thanit would be to create counter for every element in the list. For example:Input misras_gries([1,4,4,4,5,4,4])Output {'4':5}Input misras_gries([0,0,0,1,1,1,1])Output {'1':4}Input misras_gries([0,0,0,0,1,1,1,2,2],3)Output {'0':4,'1':3}Input misras_gries([0,0,0,1,1,1]Output None""".expl.
3. Largest: a recursive function that computes the largest value for an integer array of positiveand negative values. For example, for the array below, the function largest should return 22,which is the largest value in the array. You can assume there are no more 20 integers in thearray. Think of how to formulate the recurrence relation in this problem yourself.
erfd
Java Program Your program should use 2D arrays to implement simple matrix operations. Your program should do the following: • Read the number of rows and columns of a matrix M1 from the user. Use an input validation loop to make sure the values are greater than 0. • Read the elements of M1 in row major order • Print M1 to the console; make sure you format as a matirx • Repeat the previous steps for a second matrix M2 • Create a matrix M3 that is the transpose of M1 and print it to the console • Check if M1 and M2 can be added (should have the same dimensions). If possible, add M1 and M2 and print the result to the console. Otherwise print an error message. • Extra credit: Multiply M1 and M2 if possible and print to the console. If the matrices cannot be multiplied, print an error message. Implementation requirements: • Use a helper method for reading a positive integer using an input validation loop. • Use a helper method for printing a matrix. Your helper methods should be private and…
Java Objective:Design and implement simple matrix manipulation techniques.Details:Your java program should use 2D arrays to implement simple matrix operations.Your program should do the following:• Read the number of rows and columns of a matrix M1 from the user. Use an input validation loop to make sure the values are greater than 0. • Read the elements of M1 in row major order• Print M1 to the console; make sure you format as a matirx• Repeat the previous steps for a second matrix M2• Create a matrix M3 that is the transpose of M1 and print it to the console• Check if M1 and M2 can be added (should have the same dimensions). If possible, add M1 and M2 and print the result to the console. Otherwise print an error message.• Multiply M1 and M2 if possible and print to the console. If the matrices cannot be multiplied, print an error message. Implementation requirements:• Use a helper method for reading a positive integer using an input validation loop.• Use a helper method for printing…
Java program
6 - Merge sorted arrays Program a method merge_sorted(a,b) that when given two sorted arrays a and b, returns a new sorted array c that has the elements from array a and array b. For example when given = [1,3,5,6,10] a b = [1,4,6,8] %3D the resulting array should be: C = = [1,1,3,4,5,6,6,8,10] This method should not call a sorting method. Instead, the resulting array should be produced by "zipping" the two input arrays together: we repeatedly select the least element that we did not consider before from a and b and include this in c. For example: a = [1,3,5,6,10] b = [1,4,6,8] C = [1,1,3, ...] the arrows (^) point to the lowest element we did not consider before. Of these, element 4 from b is less than element 5 from a. For this reason, we select 4 as the next element and advance the arrow ^ for b to point to 6.