Answered: Suppose we use a 0-based array h[] to…

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

Suppose we use a 0-based array h[] to implement a heap of 200 elements. If an element of the heap is stored in h[71], the parent of this element can be found at h[]?

Suppose we use a 0-based array h[] to implement a heap of 200 elements. If an element of the heap is stored in h[71], the left child of this element can be found at h[]?

Suppose we use a 0-based array h[] to implement a heap of 200 elements. If an element of the heap is stored in h[71], the right child of this element can be found at h[]?

Expert Solution

Step 1:

Heap Tree - It is a non linear data structure or tree based data structure which stores the elements of tree in a specific order.
Formula for calculating parent node index value, left child index value and right child index value :
Let
n - Number of elements in an array
i - arbitrary index value f array which stores the heap elements
The index of array starts with zero so it will execute the loop from 0 to n-1 then element 'x' having index 'i' has its -
Parent at index = floor( ( i-1 )/2 )
Left Child at index = [ 2 * i ]+1
Right Child at index = [ 2 * i ]+2

Step by step

Solved in 2 steps

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