Project 2: Singly-Linked List The purpose of this assignment is to assess your ability to: ▪Implement sequential search algorithms for linked list structures ▪Implement sequential abstract data types using linked data ▪Analyze and compare algorithms for efficiency using Big-O notation For this assignment, you will implement a singly-linked node class. Use your singly-linked node to implement a singly-linked list class that maintains its elements in ascending order. The SinglyLinkedList class is defined by the following data: ▪A node pointer to the front and the tail of the list Implement the following methods in your class: ▪A default constructor list myList ▪A copy constructor list myList(aList) ▪Access to first elementmyList.front() ▪Access to last elementmyList.back() ▪Insert value myList.insert(val) ▪Remove value at frontmyList.pop_front() ▪Remove value at tailmyList.pop_back() ▪Determine if emptymyList.empty() ▪Return # of elementsmyList.size() ▪Reverse order of elements in listmyList.reverse() ▪Merge with another ordered listmyList.merge(aList) Write a thorough test program for this class. Create a Loom video in which you run your program and offer a brief explanation of your implementation. Time analysis should be included. Your video should not exceed 4 minutes in length. Play your video before you submit to ensure that the quality is acceptable. Videos with sound issues will not be considered. Submit the following in LoudCloud: •All code in a single zipped file

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 18SA

See similar textbooks

Related questions

Concept explainers

Question

Project 2: Singly-Linked List

The purpose of this assignment is to assess your ability to:

▪Implement sequential search algorithms for linked list structures

▪Implement sequential abstract data types using linked data

▪Analyze and compare algorithms for efficiency using Big-O notation

For this assignment, you will implement a singly-linked node class. Use your singly-linked node to implement a singly-linked list class that maintains its elements in ascending order.

The SinglyLinkedList class is defined by the following data:

▪A node pointer to the front and the tail of the list

Implement the following methods in your class:

▪A default constructor list<T> myList

▪A copy constructor list<T> myList(aList)

▪Access to first elementmyList.front()

▪Access to last elementmyList.back()

▪Insert value myList.insert(val)

▪Remove value at frontmyList.pop_front()

▪Remove value at tailmyList.pop_back()

▪Determine if emptymyList.empty()

▪Return # of elementsmyList.size()

▪Reverse order of elements in listmyList.reverse()

▪Merge with another ordered listmyList.merge(aList)

Write a thorough test program for this class. Create a Loom video in which you run your program and offer a brief explanation of your implementation. Time analysis should be included. Your video should not exceed 4 minutes in length. Play your video before you submit to ensure that the quality is acceptable. Videos with sound issues will not be considered.

Submit the following in LoudCloud:

•All code in a single zipped file

Expert Solution

Step by step

Solved in 4 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

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.