OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

fix: suggested changes

Browse Source
This commit is contained in:
Tishasoumya-02 2021-09-07 19:31:01 +05:30
parent ac273aa4a3
commit 36273ebb57
1 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
data_structures/reverse_a_linked_list.cpp
View File

@ -18,8 +18,8 @@
* completion of an iteration. * completion of an iteration.
* Graphic Explanation:https://bit.ly/38JLVRd * Graphic Explanation:https://bit.ly/38JLVRd
*/ */
#include <iostream> #include <iostream>/// for I/O operations
#include <memory> #include <memory> /// for dynamic memory
#include <cassert> /// for assert #include <cassert> /// for assert
/** /**
@ -57,7 +57,7 @@ class list {
// Initialize the first link // Initialize the first link
} }
void insert(int new_elem); void insert(int32_t new_elem);
void reverseList(); void reverseList();
void display(); void display();
int top(); int top();
@ -70,7 +70,7 @@ class list {
* function adds new element to the end of the list * function adds new element to the end of the list
* @param new_elem to be added to the end of the list * @param new_elem to be added to the end of the list
*/ */
void list::insert(int n) { void list::insert(int32_t n) {
Node *new_node = new Node(); Node *new_node = new Node();
Node *temp = nullptr; Node *temp = nullptr;
new_node->val = n; new_node->val = n;
@ -143,7 +143,7 @@ void list::display() {
static void test() { static void test() {
data_structures::linked_list::list L; data_structures::linked_list::list L;
// Insert testing // 1st test
L.insert(11); L.insert(11);
L.insert(12); L.insert(12);
@ -159,7 +159,7 @@ static void test() {
//Reversal Testing //Reversal Testing
assert(L.top()==18); assert(L.top()==18);
assert(L.last()==11); assert(L.last()==11);
L.display(); std::cout << "passed" << std::endl;
} }