mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-05-07 05:42:03 +08:00
fix: chamges in the code
This commit is contained in:
@@ -16,7 +16,7 @@
|
||||
* happens. And then we move the prev and current pointers one step forward.
|
||||
* Then the head node is made to point to the last node (prev pointer) after
|
||||
* completion of an iteration.
|
||||
* Graphic Explanation:https://bit.ly/38JLVRd
|
||||
* Graphic Explanation:https://bit.ly/3nbVrFe
|
||||
*/
|
||||
#include <iostream>/// for I/O operations
|
||||
#include <memory> /// for dynamic memory
|
||||
@@ -134,7 +134,7 @@ void list::display() {
|
||||
std::cout << node->val << "\t";
|
||||
node = node->next;
|
||||
}
|
||||
std::cout << "\n";
|
||||
std::cout << std::endl;
|
||||
}
|
||||
|
||||
|
||||
|
||||
Reference in New Issue
Block a user