Let the list have a head and a tail. That is, a pointer (have a marker) to both the beginning (first Node) of the list and the last Node. What process does Tail facilitate?
1-Let the list have a head and a tail. That is, a pointer (have a marker) to both the beginning (first Node) of the list and the last Node. What process does Tail facilitate?
2-insert(int index, int element): adds this element to the index position. For example, if index is 4, it adds this element between index 3 and 4 in the list. The size of the list has increased by one.
3-append(int elem): Adds the element to the end of the list. The size of the list has increased by one.
4-get(int index): Returns the element at the index position of the list, no change in the list.
5-remove(int index): Returns the element at the index position of the list. This element is removed from the list and the list size is reduced by one.
6-findMin(): returns the index of the smallest number in the list.
7-findMax(): returns the index of the largest number in the list.
8-search(int elem): searches elem in the list. It returns -1 when you can't find elem's index when you find it.
9-ToArray(): Return an array containing all the elements of the list.
Write the program in C programming language using all of the above features?
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 2 images
