1. Write a function (heapify) to satisfy the heap property from an array A. In order to implement the heapify function, please implement the below functions first: int getParent (int index); // Purpose: calculates the index of a node's parent node // Post: integer value returned to caller int getLeftChild (int index) ; // Purpose: calculates the index of node's left child // Post: integer value returned to caller int getRightchild (int index); // Purpose: caleulates the index of a node's right child // Post: integer value returned to the user void swap (ints iteml, ints item2); // Purpose: exchanges two values // Post: iteml - old item2 and item2 - old iteml, results // returned through reference parameter 2. Write a function to build a heap (buildHeap). 3. Test output with an array A[20] = {4,1,3,2,16,9,10,14,8,7}. 4. Create a function to insert numbers to the heap. 5. Test the insert function with inserting 20 and 17 sequentially to the heap (heapInset function should be called to insert 20 and 17- Do not use build_heap function in the heap_insert function). Function Prototypes: int getParent( int index); int getleftChi Id( int index); int getRightChild( int index); void swap( int& i tem1, int& item2); void heapify( int A[], int index, int size); void build_heap( int A[], int size): void printArray( int A[], int size); void heapInser t(int A[], int &size, int Item);// Do not use build heap function in the heap_insert function).
1. Write a function (heapify) to satisfy the heap property from an array A. In order to implement the heapify function, please implement the below functions first: int getParent (int index); // Purpose: calculates the index of a node's parent node // Post: integer value returned to caller int getLeftChild (int index) ; // Purpose: calculates the index of node's left child // Post: integer value returned to caller int getRightchild (int index); // Purpose: caleulates the index of a node's right child // Post: integer value returned to the user void swap (ints iteml, ints item2); // Purpose: exchanges two values // Post: iteml - old item2 and item2 - old iteml, results // returned through reference parameter 2. Write a function to build a heap (buildHeap). 3. Test output with an array A[20] = {4,1,3,2,16,9,10,14,8,7}. 4. Create a function to insert numbers to the heap. 5. Test the insert function with inserting 20 and 17 sequentially to the heap (heapInset function should be called to insert 20 and 17- Do not use build_heap function in the heap_insert function). Function Prototypes: int getParent( int index); int getleftChi Id( int index); int getRightChild( int index); void swap( int& i tem1, int& item2); void heapify( int A[], int index, int size); void build_heap( int A[], int size): void printArray( int A[], int size); void heapInser t(int A[], int &size, int Item);// Do not use build heap function in the heap_insert function).
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
Related questions
Question
Please help with C++ question in image. Thank you.
![1. Write a function (heapify) to satisfy the heap property from an array A. In order to
implement the heapify function, please implement the below functions first:
int getParent (int index);
// Purpose: calculates the index of a node's parent node
// Post: integer value returned to caller
int getLeftChild (int index) ;
// Purpose: calculates the index of node's left child
// Post: integer value returned to caller
int getRightchild (int index);
// Purpose: caleulates the index of a node's right child
// Post: integer value returned to the user
void swap (ints iteml, ints item2);
// Purpose: exchanges two values
// Post: iteml - old item2 and item2 - old iteml, results
//
returned through reference parameter
2. Write a function to build a heap (buildHeap).
3. Test output with an array A[20] = {4,1,3,2,16,9,10,14,8,7}.
4. Create a function to insert numbers to the heap.
5. Test the insert function with inserting 20 and 17 sequentially to the heap (heapInset function
should be called to insert 20 and 17- Do not use build_heap function in the heap_insert
function).
Function Prototypes:
int getParent( int index);
int getleftChi Id( int index);
int getRightChild( int index);
void swap( int& i tem1, int& item2);
void heapify( int A[], int index, int size);
void build_heap( int A[], int size):
void printArray( int A[], int size);
void heapInser t(int A[], int &size, int Item);// Do not use build heap function in the
heap_insert function).](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F620c60a1-10fe-416e-8b85-1e75a34b227e%2F5c6a8dc8-cd3b-46f1-a168-83ba860590b6%2Fldtvfp7_processed.png&w=3840&q=75)
Transcribed Image Text:1. Write a function (heapify) to satisfy the heap property from an array A. In order to
implement the heapify function, please implement the below functions first:
int getParent (int index);
// Purpose: calculates the index of a node's parent node
// Post: integer value returned to caller
int getLeftChild (int index) ;
// Purpose: calculates the index of node's left child
// Post: integer value returned to caller
int getRightchild (int index);
// Purpose: caleulates the index of a node's right child
// Post: integer value returned to the user
void swap (ints iteml, ints item2);
// Purpose: exchanges two values
// Post: iteml - old item2 and item2 - old iteml, results
//
returned through reference parameter
2. Write a function to build a heap (buildHeap).
3. Test output with an array A[20] = {4,1,3,2,16,9,10,14,8,7}.
4. Create a function to insert numbers to the heap.
5. Test the insert function with inserting 20 and 17 sequentially to the heap (heapInset function
should be called to insert 20 and 17- Do not use build_heap function in the heap_insert
function).
Function Prototypes:
int getParent( int index);
int getleftChi Id( int index);
int getRightChild( int index);
void swap( int& i tem1, int& item2);
void heapify( int A[], int index, int size);
void build_heap( int A[], int size):
void printArray( int A[], int size);
void heapInser t(int A[], int &size, int Item);// Do not use build heap function in the
heap_insert function).
Transcribed Image Text:Sample Run:
Print Array A:
4, 1, 3, 2, 16, 9, 10, 14, 8, 7,
Parent of the node 5 is the node 2
Left child of the node 3 is the node ?
Right child of the node 3 is the node 8
Calling Heapif y A, 1
4, 16, 3, 2, 7. 9, 10, 14, 8, 1,
Build heap
Print Heap A:
16. 14, 10, 8, 7, 9, 3, 2, 4, 1,
After inserting the nunber 20 into the heap A:
20, 16, 10, 8, 14, 9, 3, 2, 4, 1, 7,
hes
12 inte1
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 4 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education