Consider the following list in order: 3, 6, 8. Which pointers get updated in InsertAfter(list, node 8, node 5) is invoked.

C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter17: Linked Lists
Section: Chapter Questions
Problem 5PE
icon
Related questions
icon
Concept explainers
Question
Question 2
Consider the following list in order: 3, 6, 8.
Which pointers get updated in
InsertAfter(list, node 8, node 5) is invoked.
O tail
O Both tail and tail -> next.
O tail -> next
Transcribed Image Text:Question 2 Consider the following list in order: 3, 6, 8. Which pointers get updated in InsertAfter(list, node 8, node 5) is invoked. O tail O Both tail and tail -> next. O tail -> next
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Types of Linked List
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning