A linear collection of data elements where the linear node is given by means of pointer is called?

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.
• What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?
• A _____________ list is a list where the last node contains null pointer.
• __________________ is a header list where the last node contains the null pointer.
• The pointer of the last node contains a special value called_____________.
• 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.