BEST代写-最专业、靠谱的代写

Best代写-最专业、靠谱的代写IT&CS | 留学生作业 |编程代写 | Java | Python | C/C++ | PHP | Matlab | Assignment Project Homework代写

C语言代写Data Structure | ISCG 6426 Lab 5

C语言代写Data Structure | ISCG 6426 Lab 5

Computing and Information Technology School
Class Lab 5 ISCG 6426 Data Structures and Algorithms Semester 1, 2019
Released: May 31, 2019
Due date: June 7, 2019 Percentage Mark: 6% (5 of 5)
Aim:
Class Lab 5
Solve basic programming problems to develop abilities on data structures problem solving.
Instructions:
Code one C/C++ function such that copy a Heap defined over an array to a BT (Binary Tree). If the BT holds the heap ordering property, the BT it is called a Binary Heap. The BT is a max-heap.
Prototype:
HBT *CreateBinaryHeap(int *heap, int n);
n is a positive integer and is the size of the heap, in other words, the number of elements on the heap rather than the size of the array,
heap is an k dimensional array of integers, where k>n, and
HBT is a data type struct for the head of a binary tree
Function receives the heap in an array format. It returns the reference to a BT.
Delivery:
You should deliver, before deadline:
– All code needed.
– Code should be commented.

bestdaixie