feat: Replace recursion with iteration in BST.Contains()

idsulik · Nov 8, 2024 · c82ecd9 · c82ecd9
1 parent 3faa2a0
commit c82ecd9
Showing 1 changed file with 10 additions and 9 deletions.
diff --git a/bst/bst.go b/bst/bst.go
@@ -62,17 +62,18 @@ func (bst *BST[T]) Contains(value T) bool {
 }
 
 func (bst *BST[T]) contains(n *node[T], value T) bool {
-	if n == nil {
-		return false
-	}
-
-	if value < n.value {
-		return bst.contains(n.left, value)
-	} else if value > n.value {
-		return bst.contains(n.right, value)
+	cur := n
+	for cur != nil {
+		if value < cur.value {
+			cur = cur.left
+		} else if value > cur.value {
+			cur = cur.right
+		} else {
+			return true
+		}
 	}
 
-	return true
+	return false
 }
 
 // Remove deletes a value from the BST.