Given a BST, which traversal method would allow you to turn it into a min heap using N heap insertions calls in O(N) worst case runtime? Implement the process described above in as-close-to-Java code/no English, write the method "changeBSTintoMinHeap" which takes in a BSTNode (i.e. root) and returns a minHeap. You may use helper methods. You can use code from slides to help you. You must cite all the sources you used. You cannot simply copy and paste code from other resources (besides slides). Your work must be your own.

Given a BST, which traversal method would allow you to turn it into a min heap using N heap insertions calls in O(N) worst case runtime? Implement the process described above in as-close-to-Java code/no English, write the method "changeBSTintoMinHeap" which takes in a BSTNode (i.e. root) and returns a minHeap. You may use helper methods. You can use code from slides to help you. You must cite all the sources you used. You cannot simply copy and paste code from other resources (besides slides). Your work must be your own.

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

Must attach output screenshot, editable output In java Implement a generic min heap class and write a test code to test the program. Use hashmap for the update method. You can also use it for the getIndex method. public int getIndex(AnyType x) {//average case O(1) //returns the index of the item in the heap//or -1 if it isn't in the heap //return -1; }public boolean update(AnyType x) {//O(lg n) average case//or O(lg n) worst case if getIndex() is guarenteed O(1) We want an update() operation which increases (or decreases) the priority of the item. The item (or an equal item) will be provided and it should update the priority queue appropriately. The only way to do this efficiently is to use a map to map heap items to indexes so that you know where to start the update (in average case O(1) time). Without this, update() would be O(n) and not O(lg n). Therefore before you implement updating, you need to integrate a map into the code. Whenever an item is placed, moved, or removed…
Continuing on from your implementation of the PriorityQueue class, add the method create_heap_fast (self, values) which takes a Python list as a parameter. This method should put elements from the Python list into the priority queue without using the insert method. The Big-O of this method is O(n). The method should do the following: • Insert each element from the parameter list and append it to the binary heap. • Set the size to the number of elements in the parameter list. • Get the starting index position (i.e. last element which has a child, size // 2). • Rearrange the elements starting from the above index position by calling the percolate_down() method. • Keep rearranging and working backwards towards the root. Note: submit the entire class definition. You can assume that the parameter list is not empty. For example: Test pq PriorityQueue () keys [9, 5, 8, 6, 3, 2] pq.create_heap_fast(keys) = = print (pq) Result [0, 2, 3, 8, 6, 5, 9]
Which has a faster runtime: buildHeap() or building a heap with N heap insertion calls? What is the runtime of buildHeap()?
you will create a simple heap data structure with several methods includingmaxHeapify and buildMaxHeap. To get started, import the starter file (Heap.java) into the heappackage you create in a new Java Project. Please do not change any of the method signatures inthe Heap class. Implement the methods described below. You are free to test your code however youprefer. Remember that arrays are indexed starting at 0 in Java. This will change the math in thepseudocode.public int parent(int i)This method should return the index of the parent of the ith element of the data array. If the ithelement is the root, then the method should return -1.public int left(int i)This method should return the index of the left child of the ith element of the data array. If the ithelement is a leaf, then the index will potentially be greater than the size of the data array. That’sfine.public int right(int i)This method should return the index of the right child of the ith element of the data array. If the…
Given a BST, which traversal method would allow you to turn it into a min heap using N heap insertions calls in O(N) worst case runtime? Draw an example of this process. First, draw a BST with 4 nodes and height of 3. You can pick the integer values in your BST. Then show the resulting traversal order, and a drawing of the values inserted into a min heap using N heap insertions. Redraw the heap after each insertion.
Given a BST, which traversal method would allow you to turn it into a min heap using N heap insertions calls in O(N) worst ca se runtime? Implement the process described above in as-close-to-Java code/no English, write the method "changeBSTintoMinHeap" which takes in a BSTNode (i.e. root) and returns a minHeap. You may use helper methods.
Implement generic class ArrayStack as discussed in the lectures having following methods: constructor, push, pop, peek, isEmpty, copy constructor, reallocate (private method). Also add following methods to this class: size: returns number of elements in the stack. contains: Search an element in the stack. If found returns true, else returns false. clear: Deletes all elements of the stack and make it empty stack. Implement generic class ArrayQueue as discussed in the lectures having following methods: constructor, copy constructor, offer, poll, peek, isEmpty, reallocate(private), iterator. Inner class Iter that implements interface Iterator having methods: constructor, hasNext, next. Also add following methods to the ArrayQueue class: size: returns number of elements in the queue. contains: Search an element in the stack. If found returns true, else returns false. clear: Deletes all elements of the stack and make it empty stack. Write a class called PalindromeChecker having method…
code
The exercise consists of Hashing. Note you are notallowed to rely on Java library classes in your implementation. Part 3Implement in Java a function that takes as input an integer n  2 and generates n differentstrings all hashing to the same value when the following hash function is used.public int hashCode(String s) { int hash = 0; int skip = Math.max(1, s.length() / 3); for (int i = 0; i < s.length(); i += skip) hash = (hash * 37) + s.charAt(i); return hash;}Assume ASCII characters. and please Briefly describe your implementation .
Design a more efficient version of HeapVector that keeps its values in order only when necessary: When values are added, they are appended to the end of the existing heap and a nonHeap flag is set to true. When values are removed, the nonHeap flag is checked and the Vector is heapified if necessary. What are the worst-case and best-case running times of the add and remove operations?
Write a static method named joiner that accepts two arrays of strings al and a2 as parameters and returns a new array a3 such that each element of a3 at each index i stores a new string composed of the words stored at al[i] and a2[i] joined together with the word with the work having greater length (more characters) at the front of the concatenated string. If there is a tie, take the element from al. For example, if al and a2 store the following elements: String [] al String [] a2 {"star", "pie", "jelly bean", "car"}; {"cookie", "fig", "banana", "soda"}; Then your method should return the new array: {"cookiestar", "piefig", "jelly beanbanana", "sodacar"}. If the arrays al and a2 are not the same length, the result returned by your method should have as many elements as the shorter of the two arrays. For example, if al and a2 store the following elements: String[] al String[] a2 {"Splinter", "Leo", "April", "Don", "Raph"}; {"Krang", "Shredder", "Bebop"}; Then your method should return…