AvgCompares(), a recursive function that calculates the average number of comparisons needed by a random search hit in a given BST (the internal path length of the tree divided by its size plus one), should be added to the BST. Create two implementations: a recursive method that adds a field to each node in the tree and takes linear space and constant time every query, and a method similar to size() that takes linear space and constant time per query.

AvgCompares(), a recursive function that calculates the average number of comparisons needed by a random search hit in a given BST (the internal path length of the tree divided by its size plus one), should be added to the BST. Create two implementations: a recursive method that adds a field to each node in the tree and takes linear space and constant time every query, and a method similar to size() that takes linear space and constant time per query.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

IN JAVA, USING RECURSION PLEASE Create a method int[][] generateMatrix(int row, int col, int boundary1, int boundary2, int iteration) that generates a random matrix with random numbers between [min(boundary1, boundary2), max(boundary1, boundary2)). The sum of the diagonal and the sub-diagonal should be the same. If not, regenerate it again, until a matrix that satisfies the condition is generated (return that matrix). If you try iteration times and none of the matrixes satisfy the condition, return null.
The program BinaryTreeTest.java prints the nodes by inorder traversal. Please add two methods printPreOrder(Node node) and printPostOrder(Node node) in the program and print the numbers by the two orders. Then please add findMax(Node node)and findMin(Node node) to find the maximal and minimal numbers respectively for the tree. Hint: to implement findMax(Node node), a recursive method is needed. If the node is empty. return 0. If the node's right sub-tree is null, return the node's value. Otherwise call findMax() recursively using the right child as the parameter. findMin(Node node) is similar, but you will focus on left child.
In Java!!!. Design and implement a recursive version of a binary search. For the recursive version, instead of using a loop to repeatedly loop for the target value, allow each call to a recursive method check one value. If the value is not the target, refine the search space and call the method again. The indexes that define the range of viable candidates can be passed to the method. The base case is either finding the target value or running out of data to search. Design the program to work for on an array of sorted String objects.
Create a recursive method isOrdered() that takes a Node as an argument and two keys min and max as arguments and returns true if all the keys in the tree are between min and max; min and max are indeed the smallest and largest keys in the tree, respectively; and the BST ordering property holds for all keys in the tree; false otherwise.
Create a recursive method called isOrdered() that takes a Node and the two keys min and max as arguments. It should return true if all of the tree's keys are between min and max, min and max are, in fact, its smallest and largest keys, respectively, and the BST ordering property holds for all of the tree's keys, and false if it does not.
Write and implement a recursive version of the binary search algorithm. Also, write a version of the sequential search algorithm that can be applied to sorted lists. Add this operation to the class orderedArrayListType for array-based lists. Moreover, write a test program to test your algorithm.
Given the following recursive method, what would be the output assuming that the root is the passing value to node parameter private int unknown(Nodestnteger node) fir(node nul) return 0 else return 2*node.data + unknowntnode.left A It will return the double of the summation of the left subtree of the root node. It will return the double of the summation of the data of the root node and only the data of the left nodes of the left subtree of the root node. It will return the summation of double of the data of the root with the data values of the subtree of the root node. It will return the summation of double of the data of the root with the double of the data values of the subtree of the root node.
Recursive filtering techniques are often used to reduce the computational complexity of a repeated operation such as filtering. If an image filter is applied to each location in an image, a (horizontally) recursive formulation of the filtering operation expresses the result at location (x +1, y) in terms of the previously computed result at location (x, y). A box convolution filter, B, which has coefficients equal to one inside a rectangular win- dow, and zero elsewhere is given by: w-1h-1 B(r, y,w, h) = ΣΣΤ+ i,y + ) i=0 j=0 where I(r, y) is the pixel intensity of image I at (x, y). We can speed up the computation of arbitrary sized box filters using recursion as described above. In this problem, you will derive the procedure to do this. (a) The function J at location (x,y) is defined to be the sum of the pixel values above and to the left of (x,y), inclusive: J(r, y) = - ΣΣ14.0 i=0 j=0 Formulate a recursion to compute J(r, y). Assume that I(r, y) = 0 if r <0 or y < 0. Hint: It may be…
Convert the part to recursive way in Java: public boolean search(E data) { Node<E> curr = root; int cmp; while (curr != null) { if ((cmp = data.compareTo(curr.data)) == 0) { return true; } else if (cmp < 0) { curr = curr.left; } else { curr = curr.right; } } return false; }
Write in C Language You can only use recursive way to do this. Description Give you a matrix. Please output the elements in clockwise spiral order. Input First line is two integers m and n, shows number of rows and number of columns. Followed m lines are content of the matrix. Output Elements of the matrix in clockwise spiral order. Sample Input 1 3 3 1 2 3 4 5 6 7 8 9 Sample Output 1 1 2 3 6 9 8 7 4 5
Outline, but do not implement, a recursive solution for sorting an array of numbers. Hint: First sort the subarray without the initial element.
Consider a grid of size (x, y) where x and y are positive integers. The following figure shows an example grid of size (2,3) and two points p1 and p2 in the grid. Assume that x and y of p2 is greater than x and y of p1. p2(2,2) ectangular Snip p1(0,0) Write a recursive method named countPaths that returns the number of distinct shortest paths from p1 to p2. The method takes 4 ints as the parameters – i.e., x and y values of the two points: x1, y1, x2, and y2. Note that you do not need to print the paths. Count only. To be shortest, a path will only consist of only upward and rightward movements where each movement increases x- or y-coordinate value by 1. In the figure above, |(right, up, right, up) or (right, right, up, up) are both shortest paths from p1 to p2. For example, countPaths (0, 0, 2, 2) returns 6 countPaths (0, 0, 1, 1) returns 2 countPaths (2, 1, 2, 2) returns 1