Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
clude // size should not be negative typedef unsigne

clude // size should not be negative typedef unsigne

Database System Concepts
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
See similar textbooks
icon
Related questions
Question
Try to do it asap give output screenshots
 
Complete the code, where it says "TO DO"
code:
#ifndef __SLLIST_H__
#define __SLLIST_H__
#include "Node.h"
#include <cassert>
// size should not be negative
typedef unsigned long size_t;
namespace ds {
    template <typename ItemType> class TestDriver; // for autograding; please ignore
    /** Singly linked list. */
    template <typename ItemType>
    class SLList {
        friend class TestDriver<ItemType>; // for autograding; please ignore
        private:
        /** Pointer pointing to the sentinel node. */
        Node<ItemType> *sentinel;
        /** Stores the current size of the list. */
        size_t count;
        public:
        /** Construct a new SLList object. */
        SLList() {
        sentinel = new Node<ItemType>(ItemType(), nullptr);
        count = 0;
        }
        /** Add x at the beginning of the list. */
        void addFirst(ItemType x) {
        count += 1;
        sentinel->next = new Node<ItemType>(x, sentinel->next);
        }
        /** Return the first element. */
        ItemType &getFirst() const {
        assert(sentinel->next != nullptr);
        return sentinel->next->item;
        }
        /** Return the number of elements in list. */
        size_t size() const { return count; }
        /** Append the list with x. */
        void addLast(ItemType x) {
            count += 1;
            Node<ItemType> *p = sentinel;
            while (p->next != nullptr) {
            p = p->next;
            }
        p->next = new Node<ItemType>(x, nullptr);
        }
        SLList(const SLList<ItemType> &other);
        ~SLList();
        ItemType &get(int i) const;
        ItemType removeFirst();
        ItemType removeLast();
    };
    /** Copy constructor. */
    template <typename ItemType>
    SLList<ItemType>::SLList(const SLList<ItemType> &other) {
    // TODO: create a list that is identical to `other`
    }
    /** Destroy the SLList object. */
    template <typename ItemType>
    SLList<ItemType>::~SLList() {
    // TODO:
    }
    /** Return the i-th item in list. */
    template <typename ItemType>
    ItemType &SLList<ItemType>::get(int i) const {
    // TODO:
    }
    /** Delete and return the first item of the list. */
    template <typename ItemType>
    ItemType SLList<ItemType>::removeFirst() {
    // TODO:
    }
    /** Delete and return the last item of the list. */
    template <typename ItemType>
    ItemType SLList<ItemType>::removeLast() {
    // TODO:
    }
} // namespace ds
#endif // __SLLIST_H__
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
ListBox
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
SEE MORE TEXTBOOKS