Creation of Heap, Data Structure & Algorithms

Q. Create a heap with the given list of keys:

8, 20, 9, 4, 15, 10, 7, 22, 3, 12                                                 

Ans:

Creation of the heap:- 8 20   9  4      15   10   7     22   3     12

1200_Creation of heap.png

 

Posted Date: 7/10/2012 5:44:41 AM | Location : United States







Related Discussions:- Creation of Heap, Assignment Help, Ask Question on Creation of Heap, Get Answer, Expert's Help, Creation of Heap Discussions

Write discussion on Creation of Heap
Your posts are moderated
Related Questions
According to this, key value is divided by any fitting number, generally a prime number, and the division of remainder is utilized as the address for the record. The choice of s


Explain the Memory Function method The Memory Function method seeks to combine strengths of the top  down and bottom-up approaches  to  solving  problems  with  overlapping  su

Q. How do we represent a max-heap sequentially? Explain by taking a valid   example.         Ans: A max heap is also called as a descending heap, of size n is an almos

Approximating smooth surfaces with Polygon nets Networks of polygons are used to represent smooth surfaces. They are, of course, only an approximation to the true surface, but

Explain Optimal Binary Search Trees One of the principal application of Binary Search Tree is to execute the operation of searching. If probabilities of searching for elements

Ask queConsider the following functional dependencies: Applicant_ID -> Applicant_Name Applicant_ID -> Applicant_Address Position_ID -> Positoin_Title Position_ID -> Date_Position_O

There are ten stations on a railway line: Train travels in both directions (i.e. from 1 to 10 and then from 10 to 1).  Fare between each station is $2. A passenger input

an electrical student designed a circuit in which the impedence in one part of a series circuit is 2+j8 ohms and the impedent is another part of the circuit is 4-j60 ohm mm program

In computer programming, Trees are utilized enormously. These can be utilized for developing database search times (binary search trees, AVL trees, 2-3 trees, red-black trees), Gam