Ttykuu

Can a non-EU citizen traveling with me come with me through the EU passport line?

Is high blood pressure ever a symptom attributable solely to dehydration?

Bonus calculation: Am I making a mountain out of a molehill?

Why does Python start at index 1 when iterating an array backwards?

What makes black pepper strong or mild?

Marking the functions of a sentence: 'She may like it'

What's the purpose of writing one's academic bio in 3rd person?

How to recreate this effect in Photoshop?

Why is black pepper both grey and black?

Did Xerox really develop the first LAN?

Why there are no cargo aircraft with "flying wing" design?

∞ symbol in external pdf disappears when used as figure

What are the motives behind Cersei's orders given to Bronn?

Do you forfeit tax refunds/credits if you aren't required to and don't file by April 15?

List *all* the tuples!

Why did the IBM 650 use bi-quinary?

Sorting numerically

How does cp -a work

How to bypass password on Windows XP account?

What are 'alternative tunings' of a guitar and why would you use them? Doesn't it make it more difficult to play?

How to draw this diagram using TikZ package?

What is the longest distance a 13th-level monk can jump while attacking on the same turn?

Why is "Consequences inflicted." not a sentence?

How can I make names more distinctive without making them longer?

Simple Linked List N Insertion

.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;

0

$begingroup$

Hey guys here is a pretty simple linked list insertion in C++ and I understand most of it, but I had a question. Why does changing markerPointer at the last line effect head which is returned by the function? Shouldn't it only affect the local scope variable markerPointer?

SinglyLinkedListNode* insertNodeAtPosition(SinglyLinkedListNode* head, int data, int position) 

// Declare a new node to be inserted once we find the position in the linked list
SinglyLinkedListNode* insertNode = new SinglyLinkedListNode(data);
insertNode -> next = nullptr;

// Create a temperary pointer to traverse the linked list with
SinglyLinkedListNode* markerPointer = head;

if (position == 0) // If the position is zero insert it at the start of the list
 insertNode -> next = head; // The current head is now the next
 head = insertNode; // The new insert node is now the first element
 else 
 for (int i = 1; i < position; i++) 
 // Move through the linked list until we hit the desired position
 markerPointer = markerPointer -> next;
 

 // Now marker pointer points to the node just before the inserted node
 // Set the insert nodes next to be the marker pointers next and
 // The marker pointers next is the node

 insertNode -> next = markerPointer -> next;
 markerPointer -> next = insertNode;


return head;

c++ linked-list pointers

share

asked 6 mins ago

Doug RayDoug Ray

101

New contributor

Doug Ray is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

add a comment | 

0

$begingroup$

Hey guys here is a pretty simple linked list insertion in C++ and I understand most of it, but I had a question. Why does changing markerPointer at the last line effect head which is returned by the function? Shouldn't it only affect the local scope variable markerPointer?

SinglyLinkedListNode* insertNodeAtPosition(SinglyLinkedListNode* head, int data, int position) 

// Declare a new node to be inserted once we find the position in the linked list
SinglyLinkedListNode* insertNode = new SinglyLinkedListNode(data);
insertNode -> next = nullptr;

// Create a temperary pointer to traverse the linked list with
SinglyLinkedListNode* markerPointer = head;

if (position == 0) // If the position is zero insert it at the start of the list
 insertNode -> next = head; // The current head is now the next
 head = insertNode; // The new insert node is now the first element
 else 
 for (int i = 1; i < position; i++) 
 // Move through the linked list until we hit the desired position
 markerPointer = markerPointer -> next;
 

 // Now marker pointer points to the node just before the inserted node
 // Set the insert nodes next to be the marker pointers next and
 // The marker pointers next is the node

 insertNode -> next = markerPointer -> next;
 markerPointer -> next = insertNode;


return head;

c++ linked-list pointers

share

asked 6 mins ago

Doug RayDoug Ray

101

New contributor

Doug Ray is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

add a comment | 

$begingroup$

Hey guys here is a pretty simple linked list insertion in C++ and I understand most of it, but I had a question. Why does changing markerPointer at the last line effect head which is returned by the function? Shouldn't it only affect the local scope variable markerPointer?

SinglyLinkedListNode* insertNodeAtPosition(SinglyLinkedListNode* head, int data, int position) 

// Declare a new node to be inserted once we find the position in the linked list
SinglyLinkedListNode* insertNode = new SinglyLinkedListNode(data);
insertNode -> next = nullptr;

// Create a temperary pointer to traverse the linked list with
SinglyLinkedListNode* markerPointer = head;

if (position == 0) // If the position is zero insert it at the start of the list
 insertNode -> next = head; // The current head is now the next
 head = insertNode; // The new insert node is now the first element
 else 
 for (int i = 1; i < position; i++) 
 // Move through the linked list until we hit the desired position
 markerPointer = markerPointer -> next;
 

 // Now marker pointer points to the node just before the inserted node
 // Set the insert nodes next to be the marker pointers next and
 // The marker pointers next is the node

 insertNode -> next = markerPointer -> next;
 markerPointer -> next = insertNode;


return head;

c++ linked-list pointers

share

asked 6 mins ago

Doug RayDoug Ray

101

New contributor

Doug Ray is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

$endgroup$

SinglyLinkedListNode* insertNodeAtPosition(SinglyLinkedListNode* head, int data, int position) 

// Declare a new node to be inserted once we find the position in the linked list
SinglyLinkedListNode* insertNode = new SinglyLinkedListNode(data);
insertNode -> next = nullptr;

// Create a temperary pointer to traverse the linked list with
SinglyLinkedListNode* markerPointer = head;

if (position == 0) // If the position is zero insert it at the start of the list
 insertNode -> next = head; // The current head is now the next
 head = insertNode; // The new insert node is now the first element
 else 
 for (int i = 1; i < position; i++) 
 // Move through the linked list until we hit the desired position
 markerPointer = markerPointer -> next;
 

 // Now marker pointer points to the node just before the inserted node
 // Set the insert nodes next to be the marker pointers next and
 // The marker pointers next is the node

 insertNode -> next = markerPointer -> next;
 markerPointer -> next = insertNode;


return head;

share

asked 6 mins ago

Doug RayDoug Ray

101

New contributor

Doug Ray is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

share

asked 6 mins ago

Doug RayDoug Ray

101

New contributor

Doug Ray is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

asked 6 mins ago

Doug RayDoug Ray

101

New contributor

Doug Ray is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.

asked 6 mins ago

Doug RayDoug Ray

101