C++ Write the code to implement a complete binary heap using an array ( Not a...

C++

Write the code to implement a complete binary heap using an array ( Not a vector ). Code for Max heap.

Implement: AddElement, GetMax, HeapSort, ShuffleUp, ShuffleDown, etc

Set array size to 31 possible integers.

Add 15 elements 1,3,27,22,18,4,11,26,42,19,6,2,15,16,13

Have a default constructor that initializes the array to zeros..

The data in the heap will be double datatype.

PART 2

Convert to the program to a template, test with integers, double and char

please provide screenshots thank you so much

Expert Solution

venereology answered 1 year ago

C++ Implement the array based Binary Heap data structure as discussed in class. This structure should...

C++ Implement the array based Binary Heap data structure as discussed in class. This structure should have a couple of constructures (default constructor, and a constructor that takes an array pointer and a size), a method for inserting items into the heap, a method for removing items from the heap, and a method that returns the number of items currently stored in the heap. This implementation should be templated so that it can store any type of data (you may...

Language C++ Implement a Priority Queue with a Binary HEAP. Use a Max Heap. Create a...

Language C++ Implement a Priority Queue with a Binary HEAP. Use a Max Heap. Create a class called Node: Have a Name and Priority.Data set - 10 is the highest priority, 1 is lowest priority. Enqueue and dequeue in the following order. Function Name, Priority Enqueue Joe, 3 Enqueue Fred,1 Enqueue Tuyet,9 Enqueue Jose, 6 Dequeue Enqueue Jing, 2 Enqueue Xi, 5 Enqueue Moe, 3 DequeueEnqueue Miko, 7 Enqueue Vlady, 8 Enqueue Frank, 9 Enqueue Anny, 3 DequeueEnqueue Xi, 2 Enqueue Wali, 2 Enqueue xChe, 6 Enqueue xVerra, 8 Dequeue Dequeue Dequeue Dequeue...

Implement a Binary tree using an array using class.

Explain this code: The structure used is max heap using array. C++ (i is the index...

Explain this code: The structure used is max heap using array. C++ (i is the index of the element to be deleted) void del(int i) { int left,right,temp; arr[i]=arr[n-1]; n=n-1; left=2*i+1; /*left child of i*/ right=2*i+2; /* right child of i*/ while(right < n) { if( arr[i]>=arr[left] && arr[i]>=arr[right] ) return; if( arr[right]<=arr[left] ) { temp=arr[i]; arr[i]=arr[left]; ...

Write a code using c# Maximum Sub Array.

Write a C++ class that implement two stacks using a single C++ array. That is, it...

Write a C++ class that implement two stacks using a single C++ array. That is, it should have functions pop_first(), pop_second(), push_first(…), push_second(…), size_first(), size_second(), …. When out of space, double the size of the array (similarly to what vector is doing). Notes: Complete all the functions in exercise_2.cpp, then submit this cpp file. pop_first() and pop_second() should throw std::out_of_range exception when stack is empty. CODE: #include <cstdio> #include <stdexcept> template <class T> class TwoStacks { public: // Constructor, initialize...

Write a code in c++ using dynamic array of structure and dynamic array list. Make a...

Write a code in c++ using dynamic array of structure and dynamic array list. Make a dummy list for a company which stores following information about its customers. Customer ID Customer Name Gender Total items purchased Item category 20% discount in percentage of total purchase amount. Use dynamic array to save at least 20 items by dividing them into 3 different categories. Make a dummy list of items that company sells by dividing them into two categorizes. Items has following...

Write a recursive method to implement Binary Search of a sorted integer array. Signature of method...

Write a recursive method to implement Binary Search of a sorted integer array. Signature of method could be public int BinarySearch(int target, int low, int high)

Write a recursive method to implement Binary Search of a sorted integer array. Signature of method...

Write a recursive method to implement Binary Search of a sorted integer array. Signature of method could be public int BinarySearch(int target, int low, int high)

(IN C) Write the code to manage a Binary Tree. Each node in the binary tree...

(IN C) Write the code to manage a Binary Tree. Each node in the binary tree includes an integer value and string. The binary tree is sorted by the integer value. The functions include: • Insert into the binary tree. This function will take in as parameters: the root of the tree, the integer value, and the string. Note that this function requires you to create the node. • Find a node by integer value: This function takes in two...

Question

C++ Write the code to implement a complete binary heap using an array ( Not a...

Solutions

Expert Solution

Related Solutions

C++ Implement the array based Binary Heap data structure as discussed in class. This structure should...

Language C++ Implement a Priority Queue with a Binary HEAP. Use a Max Heap. Create a...

Implement a Binary tree using an array using class.

Explain this code: The structure used is max heap using array. C++ (i is the index...

Write a code using c# Maximum Sub Array.

Write a C++ class that implement two stacks using a single C++ array. That is, it...

Write a code in c++ using dynamic array of structure and dynamic array list. Make a...

Write a recursive method to implement Binary Search of a sorted integer array. Signature of method...

Write a recursive method to implement Binary Search of a sorted integer array. Signature of method...

(IN C) Write the code to manage a Binary Tree. Each node in the binary tree...