From b8689b69fa398b1063e7d77b4b3e6bbcc60209fa Mon Sep 17 00:00:00 2001
From: MichaelJMcGrath <mikemcgr@gmail.com>
Date: Thu, 5 Mar 2026 15:39:17 -0500
Subject: [PATCH] Update BST.java

Removed duplicate methods
---
 src/bst/BST.java | 45 ---------------------------------------------
 1 file changed, 45 deletions(-)

diff --git a/src/bst/BST.java b/src/bst/BST.java
index 56418cb..b2e1c5f 100644
--- a/src/bst/BST.java
+++ b/src/bst/BST.java
@@ -130,48 +130,3 @@ private boolean contains(TreeNode<E> node, E value, StepCounter counter) {
         else return contains(node.right, value, counter);
     }
 }
-
-    public boolean isEmpty() {
-        return size == 0;
-    }
-
-    public void insert(E value, StepCounter counter) {
-        root = insert(root, value, counter);
-    }
-
-    private TreeNode<E> insert(TreeNode<E> node, E value, StepCounter counter) {
-        if (node == null) {
-            size++;
-            return new TreeNode<>(value);
-        }
-
-        if (counter != null) counter.inc();
-
-        int cmp = value.compareTo(node.element);
-        counter.inc();
-
-        if (cmp < 0)
-            node.left = insert(node.left, value, counter);
-        else if (cmp > 0)
-            node.right = insert(node.right, value, counter);
-
-        return node;
-    }
-
-    public boolean contains(E value, StepCounter counter) {
-        return contains(root, value, counter);
-    }
-
-    private boolean contains(TreeNode<E> node, E value, StepCounter counter) {
-        if (node == null) return false;
-
-        if (counter != null) counter.inc();
-
-        int cmp = value.compareTo(node.element);
-        counter.inc();
-
-        if (cmp == 0) return true;
-        else if (cmp < 0) return contains(node.left, value, counter);
-        else return contains(node.right, value, counter);
-    }
-}