Obyerrives: - More prectice on linked lists - Create a suctod list with dcebly linked liat Fisercise It Compleie the implementation ef the given Sertedtive claws. Asuane the data is always is aseending onler. head, tail sentinel hedes pointing to the first and last nodes. The follouing functions mast be implemented: i insert i find the position atd insert the objet. 2 perfioad enereatn ce ereraser that prints the list i indenection: that returns a new sorted lot that is the interscction of two given soned lists in lincar time (i.e. O ( N ) ). s ention: that returns a new sorted Stu llat is the union of two given worted lats in linear time (ie, OYN)). ainctude class Sortedlist. i private: struct Node Object data; Node *prev; Node inext; Nodel const object d = Object } , Node * p = nulletr. Node n = nutlptr : data\{ d } , prev\{ p } , next { n } { } 3 Node whead; Node *tait; public: Sortedist( ) \{.

1. Obyerrives: - More prectice on linked lists - Create a suctod list with dcebly linked liat Fisercise
It Compleie the implementation ef the given Sertedtive claws. Asuane the data is always is
aseending onler. head, tail sentinel hedes pointing to the first and last nodes. The follouing
functions mast be implemented: i insert i find the position atd insert the objet. 2 perfioad
enereatn ce ereraser that prints the list i indenection: that returns a new sorted lot that is the
interscction of two given soned lists in lincar time (i.e. O ( N ) ). s ention: that returns a new
sorted Stu llat is the union of two given worted lats in linear time (ie, OYN)). ainctude class
Sortedlist. i private: struct Node Object data; Node *prev; Node inext; Nodel const object d =
Object } , Node * p = nulletr. Node n = nutlptr : data{ d } , prev{ p } , next { n } { } 3 Node
whead; Node *tait; public: Sortedist( ) {