JAVACreate binary search tree shown as below.Now delete the key 18, and then calculate the balance factor and convert into AVLtree by proper rotation 2) Create binary search tree shown as below.1113181433(88Now delete the key 18, and then calculate the balance factor and convert into AVLtree by properrotation3) Write a java program using streams to get the longest string from the list byusing lambda expressions

We need to create binary search tree as required and delete the key 18, and then calculate the…

Answered: 2) Create binary search tree shown as…

2) Create binary search tree shown as below. 6 11 13 18 14 33 (88 Now delete the key 18, and then calculate the balance factor and convert into AVL tree by proper rotation

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

Dictionary Walk Program Using Java, write a program which takes two words as inputs and walks through the dictionary and creates a list of words between them. Two words are “adjacent” if you can change one word into the other by adding, deleting, or changing a single letter. A “word list” is an ordered list of unique words where successive words are adjacent. Use the official Scrabble word list as your dictionary of valid words. Examples: hate → love: hate, have, hove, love dogs → wolves: dogs, does, doles, soles, solves, wolves man → woman: man, ran, roan, roman, woman flour → flower: flour, lour, dour, doer, dower, lower, flower Questions What is the shortest list between “crawl” and “run”? What is the shortest list between “mouse” and “elephant”? Does your program necessarily return the shortest list? What assumptions did you make in your program? How did you test your program? What is the Big-O complexity of your program? Additional Questions, answer three Suppose…
5. Write a program Java to search for the key element from the give list and display its location using Binary Search. The list is: 33, 55, 11, 99, 22, 88, 77, 66, 44, and the key is 99.
Make sure the program run smooth and perfectly, make sure no error encounter. compatible for python software. Complete the sample code template to implement a student list as a binary search tree (BST).Specification1. Each Studentrecord should have the following fields: =studentNumber =lastname =firstName =course =gpa2. Run the program from an appropriate menu allowing for the following operations:* Adding a Student record * Deleting a Student record * Listing students by: • All students • A given course • GPA above a certain value • GPA below a certain value class Record:def __init__(self, studentNumber = None, lastname = None, firstName = None, course = None, gpa =None,):self.studentNumber = studentNumberself.lastname = lastnameself.firstName = firstNameself.course = courseself.gpa = gpadef __str__(self):record = "\n\nStudent Number : {}\n".format(self.studentNumber)record += "Lastname : {}\n".format(self.lastname)record += "FirstName : {}\n".format(self.firstName)record…
Binary Search of Strings1. Write a version of the selection sort algorithm presented in the unit, which is usedto search a list of strings.2. Write a version of the binary search algorithm presented in the unit, which isused to search a list of strings. (Use the selection sort that you designed aboveto sort the list of strings.)3. Create a test program that primes the list with a set of strings, sorts the list, andthen prompts the user to enter a search string. Your program should then searchthe list using your binary search algorithm to determine if the string is in the list.Allow the user to continue to search for strings until they choose to exit theprogram
Contact list: Binary Search A contact list is a place where you can store a specific contact with other associated information such as a phone number, email address, birthday, etc. Write a program that first takes as input an integer N that represents the number of word pairs in the list to follow. Word pairs consist of a name and a phone number (both strings). That list is followed by a name, and your program should output the phone number associated with that name. Define and call the following function. The return value of FindContact is the index of the contact with the provided contact name. If the name is not found, the function should return -1 This function should use binary search. Modify the algorithm to output the count of how many comparisons using == with the contactName were performed during the search, before it returns the index (or -1). int FindContact(ContactInfo contacts[], int size, string contactName) Ex: If the input is: 3 Frank 867-5309 Joe 123-5432 Linda…
Write a program that implements the doubly linked list clearly explain the steps for the following functions: a) Insert an element to doubly linked b) Delete an element from doubly linked list
Old MathJax webview Old MathJax webview In Java Some methods of the singly linked list listed below can be implemented efficiently (in different respects) (as opposed to an array or a doubly linked list), others not necessarily which are they and why? b. Implement a function to add an element before the first element. c. Implement a function to add an item after the last one element. d. Implement a function to output an element of the list. e. Implement a function to output the entire list. f. Implement a function to output the number of elements. G. Implement a function to delete an item. H. Implement a function to clear the entire list. I. Implement functionality to search for one or more students by first name, last name, matriculation number or course of study. J. Implement functionality to sort the records of the student, matriculation number and course according to two self-selected sorting methods.
Language: Python 3 Autocomplete Ready O 4. Pair Of Elements having Smallest Absolute Difference 1 v import ast lst = input() 2 3 lst = ast.literal_eval (lst) 4 Given a list of unsorted integers. Find the pair of elements that have the smallest absolute difference between them. If there are multiple pairs, find them all. 5 6 print(smallest_absdiff_pairs(lst)) Implement a function smallest_absdiff_pairs that take a list of numbers and returns a list of pair of elements that have the smallest absolute difference between them. >>> smallest_absdiff_pairs([5, 4, 3, 2]) [(2, 3), (3, 4), (4, 5)] >>> smallest_absdiff_pairs([-20, -3916237, -357920, -3620601, 7374819, -7330761, 30, 6246457, -6461594, 266854, -520, -470]) [(-520, -470), (-20, 30)] >>> smallest_absdiff_pairs([-20, -3916237, -357920, -3620601, 7374819, -7330761, 30, 6246457, -6461594, 266854]) [(-20, 30)]
Home Asagnment Write a program that should create a single link list and it should insert and delete nodes from link list. Write an algorithm that should concatenate three link lists into one link list. Write an algorithm that should split a single link list into three link list. Assume that initial link list has 30 nodes. Write an algorithm that should count nodes with even values. Write an algorithm that should sort values of nodes of link list. Write an algorithm that should delete duplicate nodes from link list. Write an algorithm that should delete all nodes from link list. Write an algorithm that should reverse data of all nodes of link list.
Create a function that determines the elements in a list that can be rearranged to create a sequence of numbers where each number appears exactly once. Examples Evil ([5, 1, 4, 3, 2]) - true // It can be rearranged to have a form [1, 2, 3, 4, 5] evil ([5, 1, 4, 3, 2, 8]) false IN java programming language
• get_tokens_from_equation(line): Takes one string as input that contains any combination of digits from 0-9 and the following mathematical symbols: + - x / = ^ (O The string does not have to correspond to a valid mathematical equation. For example, '4-3=0' and '4xx5=(8' could be valid inputs to this function. The function will translate the string into a list of tokens. A token is a single non-negative number (of any length) or a single mathematical symbol. Numbers should be added to the list as integers, and symbols as strings. The tokens in the list should be in the same order as the numbers/symbols appear in the string. For example, given the string '52-2=50', the function should return the list [52, '-', 50]. >>> get_tokens_from_equation('4=3') [4, '=', 3] >>> get_tokens_from_equation('6-5=15^4/2') [6, '-', 5, '=', 15, '^', 4, '/', 2] >>> get_tokens_from_equation('288/24x6=18x13x8') [288, '/', 24, 'x', 6, '=', 18, 'x', 13, 'x', 8]
Try a spatuladef pancake_scramble(text):Analogous to flipping a stack of pancakes by sticking a spatula inside the stack and flipping over the stack of pancakes resting on top of that spatula, a pancake flip of order k performed for the text string reverses the prefix of first k characters and keeps the rest of the string as it were. For example, the pancake flip of order 2 performed on the string 'ilkka' would produce the string 'likka'. The pancake flip of order 3 performed on the same string would produce 'klika'.A pancake scramble, as defined in the excellent Wolfram Challenges programming problems site, consists of the sequence of pancake flips of order 2, 3, ... , n performed in this exact sequence for the given n-character text string. For example, the pancake scramble done to the string 'ilkka' would step through the intermediate results 'likka', 'kilka', 'klika' and 'akilk'. This function should compute and return the pancake scramble of its parameter text string. text…