What is the functionality of the following piece of code?
public int function()
{
Node temp = tail.getPrev();
tail.setPrev(temp.getPrev());
temp.getPrev().setNext(tail);
size–;
return temp.getItem();
}
a) Return the element at the tail of the list but do not remove it
b) Return the element at the tail of the list and remove it from the list
c) Return the last but one element from the list but do not remove it
d) Return the last but one element at the tail of the list and remove it from the list
Answer: b
Explanation: The previous and next pointers of the tail and the last but one element are manipulated, this suggests that the last node is being removed from the list.
Related Posts
What is the result of the given postfix expression? abc*+ where a=1, b=2, c=3.
Which of the following statement is incorrect?
While evaluating a postfix expression, when an operator is encountered, what is the correct operation to be performed?
Which of the following is not an application of stack?
Which of these operators have the highest order of precedence?
In Postfix expressions, the operators come after the operands.
What is the time complexity of evaluation of postfix expression algorithm?
Join The Discussion