Challenge 1: Insertion at Tail
Now, you will tackle the second insertion strategy in linked lists. However, you will be the one implementing it!
We'll cover the following
Problem statement
Just as “heads and tails” are polar opposites, this function is the opposite of what you saw in the last lesson. However, it is just as simple.
You need to insert a new object at the end of the linked list. You can naturally guess that this newly added node will point to NULL as it is at the tail.
Level up your interview prep. Join Educative to access 70+ hands-on prep courses.