provided code: In this two-part assignment, you will be coding an AVL, which is a special type of binary search tree. It must follow the samerules as binary search trees: each node has 0-2 children, all data in the node's left subtree is less than the parent node'sdata, all data in the node's right subtree is greater than the parent node's data, and every node's data is unique.However, an AVL differs from a BST with its self-balancing rotations, which you will implement in part one of this two-partassignment.IMPORTANT:• You will be given unlimited attempts on this assignment, with no cooldown between submissions.• Please run your code before each submission to ensure that there are no formatting errors! If there areformatting errors in your code, your code will not be graded and a submission attempt will be logged. Formore information, please review the Vocareum overview below.AVLNodeAn AVLNode class is provided to you and will be used to represent the nodes of the tree. This file should be treated as read-only and should not be modified in any way. This AVLNode class contains getter and setter methods to access and mutatethe structure of the nodes. Please make sure that you understand how this class works, as interaction with this class iscrucial for this assignment.Part 1 - RotationsIn the first part of this assignment, you will be implementing the rotation functionality of an AVL. There are four methods thatwork in conjunction to ensure that the AVL remains balanced at all times; each of which is outlined below. For thisassignment, you will be implementing those four methods. Be sure to read the javadocs for more information!updateHeightAndBFEach node contains a height and balanceFactor variable. The height variable represents the height of thenode. If you recall, a node's height is max (left node's height, right node's height) + 1 where theheight of a leaf node is O and the heights of its null children are -1. The balance factor of a node should beequal to its left child's height minus its right child's height. Since we are storing this information in each node,you no longer need to recursively compute it.The first step of this assignment is to implement the updateHeightAndBF method, which will, as the name suggests, updatethe height and balance factor of the passed in node. There are four main steps to completing this method:1. Store the left child height in a variable (keep in mind the height of a null node; you'll have to account for this!)2. Store the right child height in a variable (keep in mind the height of a null node; you'll have to account forthis!)3. Set the height of the node to be: max (left child's height, right child's height) + 14. Set the balance factor of the node to be: left child's height right child's heightrotateLeft & rotate RightThe rotateLeft and rotateRight methods will perform a single rotation on the passed in subtree and return the new root of thesubtree after it is rotated. Both of these methods will utilize updateHeightAndBF. Be sure to refer to the module video onrotations for pseudocode!Hint: Both of these methods cancompleted in just 6 lines!balanceThe balance method will chain together updateHeightAnd BF, rotateLeft, and rotateRight in order to provide therotation functionality of an AVL. The method template is already filled out for you; simply utilize the followingchart to fill in the conditionals. More information can be found in the module videos.

Answered: vided code:

Engineering

Computer Science

vided code:

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

Which of the following characters is metacharacters a + b ? c * d all above
PHP script
Which INT 21h function terminates a program?
also name which data structure is going to be used and do some changes in code C PROGRAMMING: - USING data STRUCTURE PLEASE USE SIMPLE CODING D E S C R I P T I O NDesign a project to collect household information for a census bureau which should obtain and analyze household information within the Greater Toronto Area. Data Collected: Date of collection of data using MM/DD/YYYY format  Regions: o Peel o York o Durham  Towns – required o For Peel  Brampton  Mississauga o For York  Maple  Vaughan o For Durham  Whitby  Oshawa  Race of head of household – required (Caucasian, Indigenous, African American, Asian, Other)  Number of people in the household – required, must be greater than 0  The household yearly income – required, must be numeric, must be greater than 0.InstructionsCreate an application that should:  Get information for five households from the use with data validation and then randomly populate valid information in an array of structures of 100 households; …
- Create a function to find a specific letter in a word? - Create a function to find the hypotenuse of a right-a
None
Given the following attached main function: Write the following functions based on the criteria listed. All functions written must match the calls made in the above main function. initialize sets the values of x and y to 0 and z to the blank character getHoursRate prompts the user to input the hours worked and the hourly rate to initialize the variables hours and rate payCheck calculates and returns the amount to be paid to an employee based on the hours worked and the hourly rate. For the first 40 hours, the employee makes the hourly rate stored in the rate, for hours over 40, the rate is 1.5 times the given rate. printCheck prints the hours worked, the pay rate, and the amount due the employee.