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

Related MCQs

• 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.
• In a queue, the initial values of front pointer f rare pointer r should be …….. and ……….. respectively.
• First link node of list is accessed from a pointer named
• To insert element at start, the previous pointer of newly added node would point to ______
• 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_____________.
• Any node is the path from the root to the node is called
• A _________is a linked list which always contains a special node called the header node, at the beginning of the list.