Let X and Y be two arrays. Let them contain the same distinct k keys but the keys are ordered differently. Let TX be the BST when X[0] is inserted first, then X[1], then X[2], etc. Let TY be created similarly using Y. Given X and Y, present an algorithm (pseudocode) that determines if TX and TY are the same BST without creating TX and TY. What is the running time of your algorithm? For instance, if X = [10, 3, 1, 2, 11] and Y = [10, 11, 3, 1, 2], the algo must return 'Y'. On the other hand, if X = [10, 3, 1, 2, 11] and Y = [10, 11, 3, 2, 1], the algo must return 'N'. Hint: Check if TX and TY have the same root keys first. Repeat for both subtrees of the root.

Let X and Y be two arrays. Let them contain the same distinct k keys but the keys are ordered differently. Let TX be the BST when X[0] is inserted first, then X[1], then X[2], etc. Let TY be created similarly using Y. Given X and Y, present an algorithm (pseudocode) that determines if TX and TY are the same BST without creating TX and TY. What is the running time of your algorithm? For instance, if X = [10, 3, 1, 2, 11] and Y = [10, 11, 3, 1, 2], the algo must return 'Y'. On the other hand, if X = [10, 3, 1, 2, 11] and Y = [10, 11, 3, 2, 1], the algo must return 'N'. Hint: Check if TX and TY have the same root keys first. Repeat for both subtrees of the root.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Given two arrays A and B of equal size N, the task is to find if given arrays are equal or not. Two arrays are said to be equal if both of them contain same set of elements, arrangements (or permutation) of elements may be different though.Note : If there are repetitions, then counts of repeated elements must also be same for two array to be equal. Example 1: Input: N = 5 A[] = {1,2,5,4,0} B[] = {2,4,5,0,1} Output: 1.
Write a program that takes 20 elements of array from user at run time. Find maximum element of array and swap it with last element of array. Display before and after swappingarray.
You are a movie theater manager. You are given a two-dimensional array with 6 rows and 6 columns - 36 elements with O value, that represent empty theater seats. All 36 tickets for session were sold, so you need to identify all of the seats with value 1. Write a program that replaces all O values in the given array, by 1 and outputs the resulting matrix. Use nested for-loops to iterate over two-dimensional matrix.
Write a program that reads an array A of N elements containing only 0's and 1's. Your program should find the position of a 0 and replace it with a 1 to get the longest continuous sequence of 1's. Let this position of 0 be called P. Print P if such a 0 exists and print -1 if the original array A contains only 1's. Assume the array indexing starts from 0.
Write a program that randomly fills in 0s and 1s into a 6 * 6 matrix, prints the matrix, and finds the first row and first column with the least 1s.
The Sieve of Eratosthenes is an algorithm that finds all prime numbers up to a given limit, n. It works by creating an array of Booleans, flag, of size n+1, initializing the array to true (assuming every number is a prime number in the beginning), and iteratively traversing the numbers from 2 to n, setting the values of indices that are multiples of other numbers to false. Write a program using the algorithm above, and display all the prime numbers up to 50.
Given an array of length N and an integer x, you need to find all the indexes where x is present in the input array. Save all the indexes in an array (in increasing order). Do this recursively. Indexing in the array starts from 0. Input Format : Line 1: An Integer Ni.e. size of array Line 2: N integers which are elements of the array, separated by spaces Line 3: Integer x Output Format : indexes where x is present in the array (separated by space) Constraints: 1 <= N <= 10^3 Sample Input: 5 981088 8 Sample Output : 134 Solution:///// public class Solution { public static int[] allIndexes (int input[], int x, int startIndex) { if(startIndex==input.length) { int output[] = new int[0]; return output; } int smallOutput[] = allIndexes (input,x, startIndex+1); if(input[startIndex]==x){ int output[] = new int[smallOutput.length +1]; } } output[0] = startIndex; for(int i=0;i
Create a program that will encrypt letters and create a secret code. You will create an array of numbers from 0 - 25. use [i for i in range (26)] to create an array of numbers from 0 - 25. use random.shuffle to to shuffle the above array. This will be used for a new letter index order. For example: The first created array [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25] gets shuffled to become[2, 14, 12, 20, 16, 5, 11, 1, 13, 17, 15, 21, 19, 10, 23, 22, 25, 3, 6, 7, 18, 4, 9, 24, 0, 8] This will be used as the new index for the encrypted alphabet. create an array of letters using list(string.ascii_lowercase), this requires importing the string module. This will create: ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z'] Accept an input of a word. Using the above tables take each letter of the word and convert it to the encrypted letter. Print each…
reversing the elements of an array involves swapping the corespodning elements of the array: the first with the last, the second with the next to the last, and so on, all the way to the middle of the array. given an array a, an int variable n containing the number of elements in a, and two other int variables, k and temp, write a loop that reverses the elements of the array. do not use any other variables besides a, n, k, and temp. in c++
in Python Minima in permutations. Write a program that takes an integer n from the command line, generates a random permutation, prints the permutation, and prints the number of left-to-right minima in the permutation (the number of times an element is the smallest seen so far). Then write a program that takes integers m and n from the command line, generates m random permutations of length n, and prints the average number of left-to-right minima in the permutations generated
solve in java Integer arrays originalArr and filterArr are read from input, each containing two elements. If an element in originalArr is not a multiple of the corresponding element in filterArr, replace the element in originalArr with the corresponding element in filterArr times 2. Ex: If the input is: 16 9 8 4 then the output is: 16 8 Note: Given integers A and B, A is a multiple of B only if A % B == 0. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 import java.util.Scanner; public class ReplaceNumbers { publicstaticvoidmain(String[] args) { Scannerscnr=newScanner(System.in); finalintNUM_VALS=2; int[] originalArr=newint[NUM_VALS]; int[] filterArr=newint[NUM_VALS]; inti; for (i=0; i<NUM_VALS; ++i) { originalArr[i] =scnr.nextInt(); } for (i=0; i<NUM_VALS; ++i) { filterArr[i] =scnr.nextInt(); } /* Your code goes here */ for (i = 0; i < originalArr.length; ++i) { System.out.print(originalArr[i] + " "); } System.out.println();…
Write a program that reads an integer array a[] from the console and writes out the subsequence of the array that sums to the largest value. If there are more than one such subsequence, then the program should write out the subsequence that starts at the smallest position in the array and, if there are more than one subsequence of largest sum starting at the same smallest position, it should write out the shortest such subsequence.