node.next -> node.next.next; will make...

MCQ

node.next -> node.next.next; will make

node.next inaccessible

node.next.next inaccessible

this node inaccessible

none of the above

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

In circular linked list, insertion of node requires modification of?

One pointer

Two pointer

Three pointer

Requires no modification

Discussion

MCQ

Which of the following operations is performed more efficiently by doubly linked list than by singly linked list?

Deleting a node whose location in given

Searching of an unsorted list for a given item

Inverting a node after the node with given location

Traversing a list to process each node

Discussion

MCQ

The following function reverse() is supposed to reverse a singly linked list. There is one line missing at the end of the function.

/* Link list node */
struct node
{
    int data;
    struct node* next;
};

/* head_ref is a double pointer which points to head (or start) pointer
  of linked list */
static void reverse(struct node** head_ref)
{
    struct node* prev   = NULL;
    struct node* current = *head_ref;
    struct node* next;
    while (current != NULL)
    {
        next = current->next;
        current->next = prev;
        prev = current;
        current = next;
    }
    /*ADD A STATEMENT HERE*/
}

What should be added in place of "/*ADD A STATEMENT HERE*/", so that the function correctly reverses a linked list.

*head_ref = prev;

*head_ref = current;

*head_ref = next;

*head_ref = NULL;

Discussion

MCQ

What is the output of following function for start pointing to first node of following linked list?
1->2->3->4->5->6

void fun(struct node* start)
{
  if(start == NULL)
    return;
  printf("%d ", start->data);

  if(start->next != NULL )
    fun(start->next->next);
  printf("%d ", start->data);
}

1 4 6 6 4 1

1 3 5 1 3 5

1 2 3 5

1 3 5 5 3 1

Discussion

MCQ

struct node *current = start->nextwhat "current" will contain if it is variable of type struct node ?

Address of 2nd Node

Address Field of 2nd Node

Data Field of 2nd Node

None of these

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Data Structure Topics

Data Structure Basics

Abstract data types

Arrays

Lists

Stacks

Queues

Trees

Binary Trees

B Trees

Heaps

Hash based structures

Graphs

Mixed

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Data Structure Topics