Template implementation bidirectional linked list

/************************************          wz asust    2016         templates for bidirectional linked list ******************************** /#include "sts.h" Template <class t>struct node{public:node (const t &d): Next (null), Prve (null), data (d) {}t data;node<t> *next;node<t> *prve;}; template <class t>class dlist{private: node<t>* head;node<t>*  Tail;public:       dlist (): Head (NULL), tail (NULL) {};        ~dlist () {node<t>*cur=head;while (cur) {Node<t>*del=cur;cur=cur->next;delete  del;}}      void print () {node<t>*cur=head;while (cur) {cout<<cur->data< <  " "; cur=cur->next;} cout<< "OK" &LT;&LT;ENDL;}     // void  dlist (CONST&NBSP;DLIST&LT;T&GT;&AMP;DL) {}//while not errordlist & operator= (const dlist  &LT;T&GT;&NBSP;&AMP;&NBSP;DL) {if (THIS!=&AMP;DL)   {   head=dl.head;    tail=dl.tail;   node<t>*dlcur=dl.head;   node<t>*cur=dlcur;//   cout<
Template implementation bidirectional linked list