Write a non-recursive function to find if a given number is present in a binary heap....

 

Transcribed Image Text:

Write a non-recursive function to find if a given number is present in a binary heap. The function returns True if it is resent and False if it is not. Also write its computational complexity. max_heap_size 6 H struct heap_struct crnt_heap_size 5 *elements 5 { 6 7 unsigned int max_heap_size; unsigned int crnt_heap_size; int elements; 8 }; 9 struct heap_struct * H; bool findData(struct heap_struct * H, int num) { // Write your code here } Activate Windo Go to Settings to ac Write a non-recursive function to find if a given number is present in a binary heap. The function returns True if it is resent and False if it is not. Also write its computational complexity. max_heap_size 6 H struct heap_struct crnt_heap_size 5 *elements 5 { 6 7 unsigned int max_heap_size; unsigned int crnt_heap_size; int elements; 8 }; 9 struct heap_struct * H; bool findData(struct heap_struct * H, int num) { // Write your code here } Activate Windo Go to Settings to ac