Finding the lowest leftmost node in BST

[csstudent123]

Hello ... I dont know why I cannot get the lowest leftmost node in BST: segment fault

goToLeaf=root;
//now traversing right subtree from root node
else if(strcmp(curr->barcode, traverse->barcode)>0){
		path='R';
		
		traverse=traverse->right;
		save=traverse;
		cout<<"Right subtree exists. Value in right subtree"<<endl;
		
		
		
		while(goToLeaf!=NULL){
			//prev=goToLeaf;
			goToLeaf=goToLeaf->right;
			if(goToLeaf->right->right==NULL){
				//goToLeaf=goToLeaf->left;
     
                           
			   strcpy(goToLeaf->barcode,goToLeaf->left->barcode);
				cout<<"val: "<<goToLeaf->barcode<<endl;
				break;}
				
			}

Need this to delete node in two subtreed right subtree

[ne555]

while(goToLeaf!=NULL){
	goToLeaf=goToLeaf->right; //¿what if 'goToLeaf' is NULL now?
	if(goToLeaf->right->right==NULL){ //¿what if 'goToLeaf->right' is NULL? 

[csstudent123]

what should I do? I need to find min value of the right subtree