if there are no nodes in linked list then start pointer will point at which value?

Related Questions

• Which of the following statement is true?i) Using singly linked lists and circular list, it is not possible to traverse the list backwards.ii) To find the predecessor, it is required to traverse the list from the first node in case of singly linked list.
• What differentiates a circular linked list from a normal linked list?
• How do you calculate the pointer difference in a memory efficient double linked list?
• To insert element at start, the previous pointer of newly added node would point to ______
• The situation when in a linked list START=NULL is
• The situation when in a linked list START=NULL is ….
• In a queue, the initial values of front pointer f rare pointer r should be …….. and ……….. respectively.
• In ……………, search start at the beginning of the list and check every element in the list.
• A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..
• A linear list in which each node has pointers to point to the predecessor and successors nodes is called as