Question
start->next->data
struct node {
int data;
struct node *next;
}*start = NULL;a.
Access the “data” field of 3rd node
b.
Access the “data” field of 1st node
c.
Access the “data” field of 2nd node
d.
None of these
Posted under Data Structures and Algorithms
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. Consider the below representation and predict what will be printed on the screen by following statement ? start->next->data
Similar Questions
Discover Related MCQs
Q. struct node *current = start->next
what "current" will contain if it is variable of type struct node ?
View solution
Q. If start is pointing to first node of the linked list then consider the following statement -
start = start->next;
current = start->next;
what will be the value of address field of current ?
View solution
Q. In Linked list implementation, a node carries information regarding _______.
View solution
Q. A linked list in which the last node of Linked list points to the first is called a _________.
View solution
Q. A doubly linked list performs traversal in _________.
View solution
Q. Linked list data structure usage offers considerable saving in
View solution
Q. Consider linked list is used to implement the Stack then which of the following node is considered as Top of the Stack ?
View solution
Q. The link field in the last node of the linked list contains _________.
View solution
Q. When new element is added in the middle of singly linked list then ________.
View solution
Q. Which of the following operation is performed more efficiently in doubly linked list ?
View solution
Q. If in a linked list address of first node is 1020 then what will be the address of node at 5th position ?
View solution
Q. In Circular Linked List insertion of a node involves the modification of ____ links.
View solution
Q. The time required to search an element in a linked list of length n is
View solution
Q. The worst case time required to search a given element in a sorted linked list of length n is
View solution
Q. If a list contains no elements it is said to be
View solution
Q. In a linked list array, objects are referred to as
View solution
Q. Linked list uses
View solution
Q. Number of elements stored in any list is called its
View solution
Q. Standard approach for implementation of a list is/are of
View solution
Q. An ordered sequence of data items are known to be
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
