Q1) Implement a double linked-list to store cars data. Write a double linked-list class including search, delete, append (to the head and tail), and remove (from the head and tail). Q2) Implement a LIFO stack of car data using a linked-list. Q3) Implement a min-heap of cars data that can extract the car with the lowest price. Write a min-heap class including heapify, build heap, extract, and insertion. Q4) Implement a binary search tree of car data. Write a BST class including search, insertion, and deletion.

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
100%
  • 55 BMW 228i 2008 122510 7800 65
  • Honda Accord 2011 93200 9850 45
  • Toyota Camry 2010 85300 9500 25
  • Honda Civic 2010 86400 9100 15
  • Mazda Zoom 3 2013 72450 8950 35
  • Mazda Cx7 2009 102200 7300 5
  • Toyota Corolla 2013 68900 10100 75
  • Ford Mustang 2008 112500 13200 95
  • Mercedes Benz C250 2012 65300 17300
For the following questions, you will implement the data structure to store information used by a local
car dealer. Each car has some information and stored in a text files called cars: Write a main program
for all questions to let the user enter, delete, search for information, and print current cars stored in
the data structure. Cars.txt formatted so car records separated by a blank line. Each record contains (in
order, each in a single line): ID, Make (manufacturer), Model, Year, Mileage, Price. For each question
below, write a driver main method to test your implementation. Use ID as a key to search or delete in
your methods.
Q1) Implement a double linked-list to store cars data. Write a double linked-list class including search,
delete, append (to the head and tail), and remove (from the head and tail).
Q2) Implement a LIFO stack of car data using a linked-list.
Q3) Implement a min-heap of cars data that can extract the car with the lowest price. Write a min-heap
class including heapify, build heap, extract, and insertion.
Q4) Implement a binary search tree of car data. Write a BST class including search, insertion, and
deletion.
Transcribed Image Text:For the following questions, you will implement the data structure to store information used by a local car dealer. Each car has some information and stored in a text files called cars: Write a main program for all questions to let the user enter, delete, search for information, and print current cars stored in the data structure. Cars.txt formatted so car records separated by a blank line. Each record contains (in order, each in a single line): ID, Make (manufacturer), Model, Year, Mileage, Price. For each question below, write a driver main method to test your implementation. Use ID as a key to search or delete in your methods. Q1) Implement a double linked-list to store cars data. Write a double linked-list class including search, delete, append (to the head and tail), and remove (from the head and tail). Q2) Implement a LIFO stack of car data using a linked-list. Q3) Implement a min-heap of cars data that can extract the car with the lowest price. Write a min-heap class including heapify, build heap, extract, and insertion. Q4) Implement a binary search tree of car data. Write a BST class including search, insertion, and deletion.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps

Blurred answer
Knowledge Booster
Structured English
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
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