The skeleton code is given below kindly fill the complete this function place #include #include #include #include #define NUM_NODES 7 struct heap_struct { unsigned int max_heap_size; unsigned int crnt_heap_size; int * elements; }; /* Prototypes here / struct heap_struct create_heap(unsigned int max_elements); bool is_full(struct heap_struct * H); void insert_node(int x, struct heap_struct * H); void print_heap(struct heap_struct * H); void swap_ref(int * x, int * y); int main(void) { srand((unsigned int)time(NULL)); /// Random number generator seeded with value of time int my_array[NUM_NODES]; for(int x=0; xelements = (int ) malloc(sizeof(int) (max_elements+1)); if(H->elements == NULL) { printf("\nFatal Error!! Out of memory!!\n"); exit(-1); } H->max_heap_size = max_elements; H->crnt_heap_size = 0; H->elements[0] = -1; return H; } void insert_node(int x, struct heap_struct * H) { unsigned int i; if(is_full(H)) { printf("\nError! Heap is full !!\n"); return; } else { / Complete this function / } } bool is_full(struct heap_struct * H) { return((H->crnt_heap_size) == (H->max_heap_size)); } void print_heap(struct heap_struct * H) { for(int i = 0; i < H->crnt_heap_size; i++) printf("%d\t", H->elements[i+1]); } void delete_root(struct heap_struct * H) { / Complete this function / } void swap_ref(int * x, int * y) { int temp = * y; y = x; *x = temp; }

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

Related questions

Question

The skeleton code is given below kindly fill the complete this function place #include #include #include #include #define NUM_NODES 7 struct heap_struct { unsigned int max_heap_size; unsigned int crnt_heap_size; int * elements; }; /***** Prototypes here *****/ struct heap_struct * create_heap(unsigned int max_elements); bool is_full(struct heap_struct * H); void insert_node(int x, struct heap_struct * H); void print_heap(struct heap_struct * H); void swap_ref(int * x, int * y); int main(void) { srand((unsigned int)time(NULL)); /// Random number generator seeded with value of time int my_array[NUM_NODES]; for(int x=0; xelements = (int *) malloc(sizeof(int) * (max_elements+1)); if(H->elements == NULL) { printf("\nFatal Error!! Out of memory!!\n"); exit(-1); } H->max_heap_size = max_elements; H->crnt_heap_size = 0; H->elements[0] = -1; return H; } void insert_node(int x, struct heap_struct * H) { unsigned int i; if(is_full(H)) { printf("\nError! Heap is full !!\n"); return; } else { /** Complete this function **/ } } bool is_full(struct heap_struct * H) { return((H->crnt_heap_size) == (H->max_heap_size)); } void print_heap(struct heap_struct * H) { for(int i = 0; i < H->crnt_heap_size; i++) printf("%d\t", H->elements[i+1]); } void delete_root(struct heap_struct * H) { /** Complete this function **/ } void swap_ref(int * x, int * y) { int temp = * y; *y = *x; *x = temp; }

2. Complete the function 'void delete_root (struct heap_struct
code provided.
H)' in the skeleton

1. Complete the function 'void insert_node (int x,
skeleton code provided.
struct heap_struct
H)' in the

Expert Solution

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

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.

Similar questions