erase

SearchTree.cpp

@@ -110,11 +110,15 @@ public:
         tree_node<T>* sub_tree_right = node->right;
 
         // 左子树 值
-        sub_tree_left->data.front();
+        T left_value = sub_tree_left->data.front();
+        // 右子树 值
+        T right_value = sub_tree_right->data.front();
 
         tree_node<T>* current = sub_tree_right;
-        while () {
-
+        while (current != nullptr) {
+            if (current->data.front() > left_value) {
+                current
+            }
         }
     }