Update BinarySearchTree.h

Author: developer0hye

BinarySearchTree/BinarySearchTree.h

@@ -151,9 +151,9 @@ class BinarySearchTree
 		if (node_to_be_deleted->m_left != NULL &&
 			node_to_be_deleted->m_right != NULL)
 		{
-			//q 제거 될 노드의 부모
-			//node_to_be_deleted 제거 될 노드
-			//node_to_be_changed 바뀔 노드
+			//q 제거 될 노드의 부모
+			//node_to_be_deleted 제거 될 노드
+			//node_to_be_changed 바뀔 노드
 
 			TreeNode* prevprev = node_to_be_deleted;
 			TreeNode* prev = node_to_be_deleted->m_left;
@@ -163,18 +163,14 @@ class BinarySearchTree
 				prevprev = prev;
 				prev = prev->m_right;
 			}
-
+			
 			node_to_be_deleted->m_data = prev->m_data;
-			if (prevprev == node_to_be_deleted)
-			{
-				prevprev->m_left = prev->m_left;
-			}
+			if (node_to_be_deleted == prevprev)
+				node_to_be_deleted->m_left = prev->m_left;
 			else
-			{
-				prevprev->m_left = prev->m_right;
-			}
-			delete prev;
+				prevprev->m_right = prev->m_left;
 
+			delete prev;
 		}
 		//*****************************
 
@@ -273,4 +269,4 @@ class BinarySearchTree
 
 		return os;
 	}
-};
+};