Question: 2. Operations on Head-Tail Lists Implement a data type HTLi at that realizes head tail lists consisting of nodes with integer values, as also discussed

2. Operations on Head-Tail Lists Implement a data type HTLi at that realizes head tail lists consisting of nodes with integer values, as also discussed in the lecture. Remember that: - an object of type Node looks as before; an object of type HTList has two elds, (a pointer to) a Node head and (a pointer to) a Node tai l; Modify the methods for the type List from the previous exercise so that they work for head-tail lists. You will nd that some methods need not be changed at all, while for others you also have to manage the tail pointer. (6 Points)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
