Traversal of linked list always starts from First Node - Data Structure

Q.  Traversal of a linked list always starts from the __________.
- Published on 27 Aug 15

a. First Node
b. Middle Node
c. Last Node
d. None of the Above

ANSWER: First Node
 

    Discussion

  • Nirja Shah   -Posted on 18 Nov 15
    Traversal of a linked list always starts from the First Node.
    Example:
    struct node
    {
        Int data;
        struct node ∗ link;
    } ∗ start;
    For traversing a single link list we will take a pointer P of type struct node and initialized with start.
    P=start;
    Now P points to the first node of link list. Link list can be traversed as follows.
    while(P ! NULL)
    {
        cout << (P→ data);
        P = P→link;
    }

Post your comment / Share knowledge


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)