new file: trees/binarySearchTree.go

README.md

@@ -10,18 +10,11 @@
 
 ## Tree — hierarchical, parent/child relationships
 
-- [ ] Binary Tree
 - [ ] Binary Search Tree
 - [ ] AVL Tree
 - [ ] Heap (min/max)
 - [ ] Trie
 
-## Graph — nodes connected by edges, no strict hierarchy
-
-- [ ] Directed
-- [ ] Undirected
-- [ ] Weighted
-
 ## Hash Based — key/value
 
 - [ ] Hash Map

trees/binarySearchTree.go

@@ -0,0 +1,67 @@
+package trees
+
+// Binary search tree
+
+import (
+	"fmt"
+)
+
+type NumericTypes interface {
+	int | int8 | int16 | int32 | int64 |
+		uint | uint8 | uint16 | uint32 | uint64 |
+		float32 | float64
+}
+
+type Node[T NumericTypes] struct {
+	left  *Node[T]
+	right *Node[T]
+	Data  T
+}
+
+// BSTree() -> Binary search tree, &BSTree[type] , must be in NumericTypes ;
+type BSTree[T NumericTypes] struct {
+	root *Node[T]
+}
+
+// Insert() -> Inserts Node
+func (tree *BSTree[T]) Insert(n T) {
+	tree.root = insertHelper(tree.root, n)
+}
+
+func insertHelper[T NumericTypes](node *Node[T], n T) *Node[T] {
+	if node == nil {
+		return &Node[T]{Data: n}
+	}
+
+	switch {
+	case n < node.Data:
+		node.left = insertHelper(node.left, n)
+
+	case n > node.Data:
+		node.right = insertHelper(node.right, n)
+	}
+
+	return node
+}
+
+// Display() -> prints nodes :: recursive implementation
+func (t *BSTree[T]) Display() {
+	displayHelper(t.root)
+}
+
+func displayHelper[T NumericTypes](node *Node[T]) {
+	if node == nil {
+		return
+	}
+
+	fmt.Println("node:", node.Data)
+	if node.left != nil {
+		fmt.Println("  left child:", node.left.Data)
+	}
+	if node.right != nil {
+		fmt.Println("  right child:", node.right.Data)
+	}
+
+	displayHelper(node.left)
+	displayHelper(node.right)
+}