update

Author: Dentrax

array-minimum-distance/array-minimum-distance

@@ -32,7 +32,7 @@ func New(data int) *Node {
 func Search(root *Node, key int) *Node {
 	//1. Base Cases: root is null or key is present at root
 	if root == nil || root.data == key {
-		fmt.Println("The given previous node cannot be NULL")
+		//fmt.Println("The given previous node cannot be NULL")
 		return root
 	}
 

binary-search-tree-1-insertion/binary-search-tree-1-insertion.go

@@ -29,7 +29,6 @@ func New(data int) *Node {
 }
 
 func main() {
-
 	//To allocate dynamically a new Node in C language : root = (struct Node*) malloc(sizeof(struct Node));
 	root := New(1)
 	/*

binary-tree-1-introduction/binary-tree-1-introduction.go

@@ -0,0 +1 @@
+package main

linked-list-circular-1-introduction/linked-list-circular-1-introduction.go

@@ -61,7 +61,6 @@ func Pop(stack *Stack) int {
 }
 
 func main() {
-
 	stack := New(100)
 
 	Push(stack, 10)
@@ -72,5 +71,4 @@ func main() {
 	fmt.Println("Pushed to stack : 30")
 
 	fmt.Printf("Popped from stack : %d", Pop(stack))
-
 }