Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Topic: Singly Linked List Implement the following functions in C++ program. Read the question carefully.  (See attached photo for reference)    void isEmpty() This method will return true if the linked list is empty, otherwise return false. void clear() This method will empty your linked list. Effectively, this should and already has been called in your destructor (i.e., the ~LinkedList() method) so that it will deallocate the nodes created first before deallocating the linked list itself.

Topic: Singly Linked List Implement the following functions in C++ program. Read the question carefully.  (See attached photo for reference)    void isEmpty() This method will return true if the linked list is empty, otherwise return false. void clear() This method will empty your linked list. Effectively, this should and already has been called in your destructor (i.e., the ~LinkedList() method) so that it will deallocate the nodes created first before deallocating the linked list itself.

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

Topic: Singly Linked List
Implement the following functions in C++ program. Read the question carefully.  (See attached photo for reference) 

 

  • void isEmpty()

This method will return true if the linked list is empty, otherwise return false.

  • void clear()

This method will empty your linked list. Effectively, this should and already has been called in your destructor (i.e., the ~LinkedList() method) so that it will deallocate the nodes created first before deallocating the linked list itself.

 

 

public: LinkedList() { index = 0; head = NULL; tail = NULL; -LinkedList() { clear();
Transcribed Image Text:public: LinkedList() { index = 0; head = NULL; tail = NULL; -LinkedList() { clear();
class LinkedList : public List { node* head; node* tail; int index; node* create_node(int num) { node* n = (node *) malloc( sizeof(node) ); n->element = num; n->next = NULL; return n; }
Transcribed Image Text:class LinkedList : public List { node* head; node* tail; int index; node* create_node(int num) { node* n = (node *) malloc( sizeof(node) ); n->element = num; n->next = NULL; return n; }
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
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