What is the location of parent node for any arbitary node i? Options: A . &nbsp(i/2) position B . &nbsp(i+1)/ position C . &nbspfloor(i/2) position D . &nbspceil(i/2) position

What is the location of parent node for any arbitary node i?

Question

What is the location of parent node for any arbitary node i?

Options:

A . (i/2) position

B . (i+1)/ position

C . floor(i/2) position

D . ceil(i/2) position

Answer: Option C

For any node child nodes are located at either 2*i , 2*i +1 So the parent node could be found by taking the floor of the half of child node.

Was this answer helpful ?

Next Question

Question 1. An array consist of n elements.We want to create a heap using the elements.The time complexity of building a heap will ....complexity of building a heap will be in order of

Question 2. Time taken in decreasing the node value in a binomial heap is ....

Question 3. What does this pseudo_code return ?int myfun(heap_arr[]) { int mini=INF; for(int i=0;i....

Question 4. State the complexity of algorithm given belowint function(vector arr) int len=arr.length(); if(len==0) return; temp=arr....the complexity of algorithm given belowint function(vector arr) int len=arr.length(); if(len==0) return; temp=arr[len-1]; arr.pop_back(); return temp;

Question 5. Heap can be used as¦ ....

Question 6. What will be the order of new heap created after union of heap H1 and H2 when created by the following code.Initially b....min[H2] n[H]= n[H1] + n[H2] free the objects H1 and H2 return H }

Question 7. What is wrong with the following code of insertion in fibonacci heap. Choose the correct optionFIB-INSERT(H, x) degr....NIL or key[x] > key[min[H]] then min[H]= x n[H]= n[H] + 1

Question 8. What is the complexity of given function of insertion. insert(int n) { if(buffer_size()< maxi_biffer_size()) buffer_....is the complexity of given function of insertion. insert(int n) { if(buffer_size()< maxi_biffer_size()) buffer_aar[ind]==n; else move_to_heap(buffer,buffer+maxi_buffer_size()) }

Question 9. Does there exist a heap with seven distinct elements so that the In order traversal gives the element in sorted order. ....the In order traversal gives the element in sorted order.

Chapter 1 - GLOBAL STEEL SCENARIO & INDIAN STEEL INDUSTRY Part 1 : (13-04-2024) INDUSTRY AND COMPANY AWARENESS (ICA)

Direction Sense Test Part 1 Reasoning (Hindi)

Chapter 1 - RMHP / OHP / OB & BP Part 1 : (14-02-2024) GPOE

Cube & Cuboid Part 1 Reasoning (Hindi)

Data Interpretation (DI) Basic Concept Reasoning (Hindi)

Counting Figures Part 1 Counting Of Straight Lines Reasoning (Hindi)

Sail E0 free webinar Webinars

Real Numbers Part 7 Class 10 Maths

Real Numbers Part 1 Class 10 Maths

Polynomials Part 1 Class 10 Maths

DSP Combined 1 Free Revision Test SAIL JO E-0

GPOE / GPA Combined 1 Free Revision Test SAIL JO E-0

BSP Plant Specific Review Test SAIL JO E-0

BSL Combined 1 Free Revision Test SAIL JO E-0

GFM Combined 1 Free Revision Test SAIL JO E-0