WTesting insert:

Starting with an empty list

After adding Ceb, the list has:

Ceb

After adding Yatoro, the list has:

Ceb$$ Yatoro

After adding Topson, the list has:

Ceb $$ Topson $$ Yatoro

Hints:

You will need to dynamically create a new Node object.

If the list is empty, you will need to adjust both the head$\_$and tail$\_$pointers.

If the list is not empty, you will need to search for the position to insert the new Node object. It could be at the beginning, at the end, or somewhere in the middle. Depending on the insert position, you may need to adjust the head$\_$or the tail$\_$pointer or neither.

Three things need to be submitted:

The pseudocode $($or flowchart$)$ for the insert$\_$in$\_$order method: This shall detail the key elements and decision making of the algorithm. The pseudocode accounts for up to $1$ out of $10$ points of the assignment. It is possible to receive full credits on this portion of the assignment even if your program is not fully functional. The pseudocode document shall be uploaded as a separate file to the Replit project.

The source code of the program: This accounts for up to $6$ out of $10$ points of the assignment. It will be evaluated based on the completeness of the program.

The different test cases for the insert$\_$in$\_$order method: This shall describe the different parameter scenarios and needed pointer manipulations to insert the new node at the correct position. Make sure to consider all possible cases such as inserting into an empty list, inserting at the beginning, in the middle, or at the end... And then draw diagrams illustrating the Node sequences. The test cases account for up to $3$ out of $10$ points of the assignment. Even if your program is not fully functional, you may still receive full credits on this portion of the assignment. The test case document shall be uploaded as a separate file to the

Repl.it project. Here is one example test case: