a. Write a method boolean Replace(int item, int new_item) that replaces all occurrences of item in a list with new_item and return false if new_item is not found. For example, if item is "3" new_item is 5, then the method should replace all nodes that contain 3 with 5. b. [s] Write a method void merge(Linked List LL, boolean append) that takes another linked list as a parameter, merges it with current linked list adding it after the original linked list if append is true, else the new list should be added before the original linked list. The below figures demonstrates the concept: Append is the Append is false Original new Last First First new Original

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
i need the answer quickly
a. Write a method boolean Replace(int item, int new_item) that replaces all
occurrences of item in a list with new_item and return false if new_item is not found. For
example, if item is "3" new_item is 5, then the method should replace all nodes that
contain 3 with 5.
b. [is] Write a method void merge(Linked List LL, boolean append) that takes another
linked list as a parameter, merges it with current linked list adding it after the original
linked list if append is true, else the new list should be added before the original linked
list. The below figures demonstrates the concept:
Append is me
Append is false
Original
new
Last
First
First
new
Original
Transcribed Image Text:a. Write a method boolean Replace(int item, int new_item) that replaces all occurrences of item in a list with new_item and return false if new_item is not found. For example, if item is "3" new_item is 5, then the method should replace all nodes that contain 3 with 5. b. [is] Write a method void merge(Linked List LL, boolean append) that takes another linked list as a parameter, merges it with current linked list adding it after the original linked list if append is true, else the new list should be added before the original linked list. The below figures demonstrates the concept: Append is me Append is false Original new Last First First new Original
Expert Solution
steps

Step by step

Solved in 3 steps with 4 images

Blurred answer
Knowledge Booster
Concept of Threads
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.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education