**fig4_17.txt** /* 1*/ template /* 2*/ const Binary_Search_Tree & /* 3*/ Binary_Search_Tree:: /* 4*/ operator = ( const Binary_Search_Tree & Value ) /* 5*/ { /* 6*/ if( this != &Value ) /* 7*/ { /* 8*/ Make_Empty( Root ); /* 9*/ Root = Copy( Value.Root ); /*10*/ Last_Find = Root; /*11*/ } /*12*/ return *this; /*13*/ } /*14*/ template /*15*/ Tree_Node * /*16*/ Binary_Search_Tree:: /*17*/ Copy( const Tree_Node *T ) /*18*/ { /*19*/ if( T != NULL ) /*20*/ return new Tree_Node /*21*/ ( T->Element, Copy( T->Left ), Copy( T->Right ) ); /*22*/ else /*23*/ return NULL; /*24*/ }