Q. Write  down the  algorithm  to  insert  an  element  to  a  max-heap  which  is  represented sequentially.          

Ans:

The algorithm to insert an element "newkey" to a max heap of size i-1 where i>=1:

s=i;

parent=s div 2;

key[s]=newkey;

while(s<>0 && key[parent]<=key[s])

{

/*interchange parent and child*/

temp=key[parent]; key[parent]=key[s]; key[s]=temp;

s=parent;

parent=s div 2;

}

Posted Date: 7/10/2012 6:24:51 AM | Location : United States

Ask an Expert

Related Discussions:- Algorithm to insert element to a max-heap sequentially, Assignment Help, Ask Question on Algorithm to insert element to a max-heap sequentially, Get Answer, Expert's Help, Algorithm to insert element to a max-heap sequentially Discussions

Write discussion on Algorithm to insert element to a max-heap sequentially
Your posts are moderated

Write your message here..

Related Questions

Explain in brief about the container, Explain in brief about the Container ... Explain in brief about the Container An entity which holds finitely many other entities. Just as containers such as boxes, baskets, bags, pails, cans, drawers, and so for

Threaded binary tree, i need the full concept of it... please can anyone pr... i need the full concept of it... please can anyone provide

Tree traversals, There are three kinds of tree traversals, namely, Postorde... There are three kinds of tree traversals, namely, Postorder , Preorder and Inorder. Preorder traversal: Each of nodes is visited before its children are visited; first the roo

Representing sparse matrix in memory using array, Q. What do you understand... Q. What do you understand by the term sparse matrix? How sparse matrix is stored in the memory of a computer? Write down the function to find out the transpose of a sparse matrix u

Boar corloring, Board coloring , C/C++ Programming Board coloring , C/C++ Programming

Order of efficiency - linear search, Linear search employee an exhaustive m... Linear search employee an exhaustive method of verified each element in the array against a key value. Whereas a match is found, the search halts. Will sorting the array before uti

Frequency count, what is frequency count with examble what is frequency count with examble

Construct a minimum spanning tree, Construct G for α, n, and W given as com... Construct G for α, n, and W given as command line parameters. Throw away edges that have an asymmetric relation between nodes. That is, if A is connected to B, but B is not connect

Structure of an avl tree, Given is the structure of an AVL tree: struct ... Given is the structure of an AVL tree: struct avl { struct node *left; int info; int bf; struct node *right; }; 2) A multiway tree of n order is an ord

Boundary tag method in context of dynamic memory management, Q. How can we ... Q. How can we free the memory by using Boundary tag method in the context of Dynamic memory management?