Data Structures And Algorithm
Assume that you want to create a linked list structure
for ‘item’s. You are given
item(string x, item* t)
In our implementations we used first and last
pointers to keep first items and last item of linked list.
Once we add new item, a new structure is created
and added as last item.
Assume that we have only first pointer, and do not
have last pointer. Complete the following function to
add an item to at the beginning (front) of Linked
Listed using only “first” pointer. Just submit function
implementation, not the whole program.
bool Bag::insertFront(string str)