Created by sing namespace std; lass SinglyLinkedListNode { VINSERT YOUR CODE HERE Lass SinglylinkedList { public: SinglyLinkedListNode head; SinglyLinkedListNode tail; Singlylinkedlist() { this->head- nullptr; this->tail- nullptr; void insert_node(int node_data) { // INSERT YOUR CODE HERE

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 have C++ QUESTİON. documentation is included in sreenshots. Thank you

// Assignment3.cpp
// CMPE210
//
//
Created by
//
using namespace std;
class SinglyLinkedListNode {
// INSERT YOUR CODE HERE
};
class SinglyLinkedList {
public:
SinglyLinkedListNode *head;
SinglyLinkedListNode *tail;
SinglyLinkedList() {
this->head = nullptr;
this->tail = nullptr;
}
void insert_node(int node_data) {
// INSERT YOUR CODE HERE
};
void free_singly_linked_list(SinglyLinkedListNode* node) {
// INSERT YOUR CODE HERE
// Complete the has_cycle function below.
/*
* For your reference:
SinglyLinkedListNode {
int data;
SinglyLinkedListNode* next;
};
*/
bool has_cycle(Sing lyLinkedListNode* head) {
SinglyLinkedListNode* temp = head;
bool iscycle = false;
while (temp != nullptr)
// INSERT YOUR CODE HERE
}
int main()
{
// INSERT YOUR CODE HERE TO TEST YOUR CODE
return 0;
Transcribed Image Text:// Assignment3.cpp // CMPE210 // // Created by // using namespace std; class SinglyLinkedListNode { // INSERT YOUR CODE HERE }; class SinglyLinkedList { public: SinglyLinkedListNode *head; SinglyLinkedListNode *tail; SinglyLinkedList() { this->head = nullptr; this->tail = nullptr; } void insert_node(int node_data) { // INSERT YOUR CODE HERE }; void free_singly_linked_list(SinglyLinkedListNode* node) { // INSERT YOUR CODE HERE // Complete the has_cycle function below. /* * For your reference: SinglyLinkedListNode { int data; SinglyLinkedListNode* next; }; */ bool has_cycle(Sing lyLinkedListNode* head) { SinglyLinkedListNode* temp = head; bool iscycle = false; while (temp != nullptr) // INSERT YOUR CODE HERE } int main() { // INSERT YOUR CODE HERE TO TEST YOUR CODE return 0;
January 2, 2022
A linked list is said to contain a cycle if any node is visited more than once while traversing the list.
Given a pointer to the head of a linked list, determine if it contains a cycle. If it does, return 1. Otherwise,
return 0.
Example:
head refers to the list of nodes 1→ 2 → 3 →1→ NULL.
There is a cycle where node 3 points back to node 1, so return 1.
Function Description:
Complete the has-cycle function provided in the moodle assignment folder.
It has the following parameter:
• SinglyLinkedListNode pointer head: a reference to the head of the list.
Returns:
int: 1 if there is a cycle or 0 if there is not.
Note: if the list is empty, head will be null.
Input Format:
The code stub reads from stdin and passes the appropriate argument to your function. The custom
test cases format will not be described for this question due to its complexity. Expand the section for the
main function and review the code if you would like to figure out how to create a custom case.
Constraints: List size can be minimum 0 and maximum 1000.
Sample Input:
References to each of the following linked lists in the figure above are passed as arguments to your
function:
Transcribed Image Text:January 2, 2022 A linked list is said to contain a cycle if any node is visited more than once while traversing the list. Given a pointer to the head of a linked list, determine if it contains a cycle. If it does, return 1. Otherwise, return 0. Example: head refers to the list of nodes 1→ 2 → 3 →1→ NULL. There is a cycle where node 3 points back to node 1, so return 1. Function Description: Complete the has-cycle function provided in the moodle assignment folder. It has the following parameter: • SinglyLinkedListNode pointer head: a reference to the head of the list. Returns: int: 1 if there is a cycle or 0 if there is not. Note: if the list is empty, head will be null. Input Format: The code stub reads from stdin and passes the appropriate argument to your function. The custom test cases format will not be described for this question due to its complexity. Expand the section for the main function and review the code if you would like to figure out how to create a custom case. Constraints: List size can be minimum 0 and maximum 1000. Sample Input: References to each of the following linked lists in the figure above are passed as arguments to your function:
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Operations of Linked List
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
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