Predict the Output
ListNode *p = new ListNode(56.4, new ListNode(31.5));
ListNode *q = p;
while (q−>next−>next != nullptr)
q = q−>next;
cout << q−>value;
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.