In a max-heap, element with the greatest key is always in the which node?

Related Questions

• If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.
• A _________is a linked list which always contains a special node called the header node, at the beginning of the list.
• In a directed tree any node which has out degree 0 is called a terminal node or__________.
• A linked list whose last node points back to the list node instead of containing the null pointer________.
• _______________is a header list where the last node points back to the header node.
• A path P of length n from a node u to a node v is defined as a sequence of _________ nodes.
• If every node u in G is adjacent to every other node v in G, A graph is said to be _______.
• To insert a new node in linked list free node will be available in ___________.
• A ______________ list is a header list where the node points back to the header node.
• The worst case complexity of deleting any arbitrary node value element from heap is