All our Essay orders are Original, and are written from scratch. Try us today at 30% off

Reserve For Humaira

CS2413 – Fall2021 Programming Assignment – 4 Due on 11/29/2021, 11:59PM
In this assignment, you will need to implement AVL Tree & Min Heap using vector (please follow the template files given to you hw4_A_template.cpp and hw4_B_template.cpp) NOTE: Please save the files as “HW4_partA.cpp” and “HW4_partB.cpp” ONLY.
● Please do not modify existing codes in the template, especially the input / output formats. Only add your implementations to it.
● The auto-grader only recognizes the formats in this template. ● The main function has been written for you. It will test your member functions. You can
also use it to debug the code. The rubrics for assignment 4. AVL_Insert( ) method – 45 points Minimum Heap Insertion – 25 points Minimum Heap Removal – 25 points Documentation – 5 points Homework 4 Part A
● For AVL tree, the class Node is provided for you to create nodes. Implement the following function:
• AVL_Insert(Node* x) ● We only test insertion results using in-order enumeration. We implement the enumeration
function for you. ● You implement additional helper functions.
Here is a sample input and expected output for each case: (This is only for your reference: not used for testing). Example for AVL_Insert() method (choice 1)
Input: 65 55 35 45 13 18 25 5 85 4 1 Output: 4 5 13 18 25 35 45 55 65 85
 

 
Homework 4 Part B
You will implement minimum heap using vector. The code template (hw4_B_template.cpp) is provided and the goal is to implement insertion and removal functions of minimum heap.
Minimum Heap is a complete binary tree where the value of each node is less than (or equal) to the value of any of its child. The insert function should add each item to the heap (in our template the item is stored in a vector) and when doing so the function should maintain the vector as minimum heap. The remove function will delete the smallest element (which is the root element) from the heap and update the vector such that it remains as minimum heap after the deletion.
You can add extra functions that you think are necessary to complete the goal.
Below is an example to illustrate minimum heap insertion and removal.
Suppose we want to insert the following items into the heap: 10 9 8 7 6 11 12 13 14 15
insert(key) vector <int> x insert(10)
 
10
insert(9)
 
9 10
insert(8)
 
8 10 9
insert(7)
 
7 8 9 10
 

 
insert(6)
 
6 7 9 10 8
insert(11)
 
6 7 9 10 8 11
insert(12)
 
6 7 9 10 8 11 12
insert(13)
 
6 7 9 10 8 11 12 13
insert(14)
 
6 7 9 10 8 11 12 13 14
 

 
insert(15)
 
6 7 9 10 8 11 12 13 14 15
 
When we remove the root from the minimum heap above, the output will look like:
remove() vector <int> x
 
7 8 9 10 15 11 12 13 14
 
Here is a sample input and expected output for each case on minimum heap:
Minimum Heap Insertion Input: 10 9 8 7 6 11 12 13 14 15
1 Output: 6 7 9 10 8 11 12 13 14 15
Minimum Heap Removal Input: 10 9 8 7 6 11 12 13 14 15
2 Output: 7 8 9 10 15 11 12 13 14
 
 

 
Some links to help you
– https://www.cs.usfca.edu/~galles/visualization/AVLtree.html – https://www.cs.usfca.edu/~galles/visualization/Heap.html

The post Reserve For Humaira first appeared on Assignment writing service.

  

Testimonials

Mh! not bad…

The worst part ever was to find my deadline postponed for 1 hour ! They couldn`t finish the essay within...

Comes through every time

I have used this website for many times, and each time they found perfect writers for me and they produce...

Great Job

Great job! Those were you, guys, who made my coursework perfect in time according to all my requirements. I will...

No Complaints So far Guys

Yeah …I really like all the discounts that they offer, the prices are very flexible. Plus they have different promotions...

Best Service

The book review I asked for is so amazing! Endless thanks to your team for completing my review and for...

Best

They look cool and trustworthy enough to me. I gather they made discounts as their prices are quite affordable if...

CLICK HERE  To order your paper

About Scholarfront Essay writing service

We are a professional paper writing website. If you have searched a question and bumped into our website just know you are in the right place to get help in your coursework. We offer HIGH QUALITY & PLAGIARISM FREE Papers.

How It Works

To make an Order you only need to click on “Order Now” and we will direct you to our Order Page. Fill Our Order Form with all your assignment instructions. Select your deadline and pay for your paper. You will get it few hours before your set deadline.

Are there Discounts?

All new clients are eligible for upto 20% off in their first Order. Our payment method is safe and secure.

 CLICK HERE to Order Your Assignment

 

ORDER WITH 15% DISCOUNT

Let your paper be done by an expert

Custom Essay Writing Service

Our custom essay writing service has already gained a positive reputation in this business field. Understandably so, all custom papers produced by our academic writers are individually crafted from scratch and written according to all your instructions and requirements. We offer Havard, APA, MLA, or Chicago style papers in more than 70 disciplines. With our writing service, you can get quality custom essays, as well as a dissertation, a research paper, or term papers for an affordable price. Any paper will be written on time for a cheap price.

Professional Essay writing service

When professional help in completing any kind of homework is all you need, scholarfront.com is the right place to get it. We guarantee you help in all kinds of academia, including essay, coursework, research, or term paper help etc., it is no problem for us. With our cheap essay writing service, you can be sure to get credible academic aid for a reasonable price, as the name of our website suggests. For years, we have been providing online custom writing assistance to students from countries all over the world, including the United States, Canada, the United Kingdom, Australia, Italy, New Zealand, China, and Japan.