Linked Lists C++

Question 1

Insertion algorithm

Answer 1

Always do prepend or append first, the algorithm core is then:

//Create the new ellement, pointing to the right node (node after)
SLList::nodeItem* newNodeItem{new SLList::nodeItem{val, ellementAfter}};

//Update ellement before to point to the next ellement
(*ellementBefore).mNodeNextNode = newNodeItem;

Question 2

Removal algorithim

Answer 2

//Update ellement before to ellement after
if(!isHeadUpdating && !isTailUpdating) {
(ellementBefore).mNodeNextNode = ellementAfter;
} else if(!isHeadUpdating && isTailUpdating){
(ellementBefore).mNodeNextNode = nullptr;
mPLast = ellementBefore;
} else if(isHeadUpdating && !isTailUpdating) {
mPFirst = ellementAfter;
} else if (isHeadUpdating && isTailUpdating) {
mPLast = nullptr;
mPFirst = nullptr;
}

Question 3

Array / Node indexing

Answer 3

Use a for loop that increments exactly n times from the head.

Question 4

Assignment / copy constructor

Answer 4

While pCurr != nullptr, append value at pCurr and incriment.

Question 5

Construct from array

Answer 5

Loop size times and append

Question 6

Append

Answer 6

//If this is the new first ellement in the list, update the head pointer
if(mPFirst == nullptr) {
mPFirst = pHeadNodeAllocation;
}
//If the list has data, update the ellement pointed to by tail to point to this value
else {
(*mPLast).mNodeNextNode = pHeadNodeAllocation;
}

//No matter what, update the tail to point to the new data
mPLast = pHeadNodeAllocation;

Question 7

Prepend

Answer 7

SLList::nodeItem* pHeadNodeAllocation{new SLList::nodeItem{val, mPFirst}};

//Update last ellement if needed
if(mPLast == nullptr) {
mPLast = pHeadNodeAllocation;
}

//Always update first ellement
mPFirst = pHeadNodeAllocation;