Given the Node class implementation, select one of the following that…

PYQ AMCAT 2024

Given the Node class implementation, select one of the following that correctly inserts a node at the tail of the list.

public class Node

{

protected int data;

protected Node prev;

protected Node next;

public Node(int data)

{

this.data = data;

prev = null;

next = null;

}

public Node(int data, Node prev, Node next)

{

this.data = data;

this.prev = prev;

this.next = next;

}

public int getData()

{

return data;

}

public void setData(int data)

{

this.data = data;

}

public Node getPrev()

{

return prev;

}

public void setPrev(Node prev)

{

this.prev = prev;

}

public Node getNext()

{

return next;

}

public void setNext(Node next)

{

this.next = next;

}

}

public class DLL

{

protected Node head;

protected Node tail;

int length;

public DLL()

{

head = new Node(Integer.MIN_VALUE,null,null);

tail = new Node(Integer.MIN_VALUE,null,null);

head.setNext(tail);

tail.setPrev(head);

length = 0;

}

}

  1. A.

    public void insertRear(int data)

    {

    Node node = new Node(data,tail.getPrev(),tail);

    node.getPrev().setNext(node);

    tail.setPrev(node);

    length++;

    }

  2. B.

    public void insertRear(int data)

    {

    Node node = new Node(data,tail.getPrev(),tail);

    node.getPrev().getPrev().setNext(node);

    tail.setPrev(node);

    length++;

    }

  3. C.

    public void insertRear(int data)

    {

    Node node = new Node(data,tail.getPrev(),tail);

    node.setNext(tail);

    tail.setPrev(node);

    length++;

    }

  4. D.

    public void insertRear(int data)

    {

    Node node = new Node(data,tail,tail.getPrev());

    node.getPrev().setNext(node);

    tail.setPrev(node);

    length++;

    }

Attempted by 75 students.

Sign up free to check your answer

Sign up free

Explore the full course: Cdac C Cat Complete Preparation

Loading lesson…