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
what are grounded header linked lists?

Example: (Single rotation into AVL tree, while a new node is inserted into the AVL tree (LL Rotation)) Figure: LL Rotation The rectangles marked A, B & C are trees

Data Structure and Algorithm 1. Explain linked list and its types. How do you represent linked list in memory? 2. List and elucidate the types of binary tree. 3. Descr

Data Structure and Methods: Build an array structure to accomodate at least 10 elements. Provide routines for the following: An initializer. A routine to populate (

how to learn about time complexity of a particular algorithm

The below figure illustrates the BOM (Bill of Materials) for product A. The MPS (Material requirements Planning) start row in the master production schedule for product A calls for


How can a lock object be called in the transaction? By calling Enqueue and Dequeue in the transaction.

Explain principle of Optimality It indicates that an optimal solution to any instance of an optimization problem is composed of  optimal solutions to its subinstances.

What is a Binary Search Tree (BST)? A binary search tree B is a binary tree every node of which satisfies the three conditions: 1.  The value of the left-subtree of 'x' is le