refactoring

Antesh Sharma · Antesh Sharma · commit 355d044a487f · 2022-03-27T17:44:00.000+05:30
diff --git a/src/main/java/com/antesh/dsa/bst/BinarySearchTree.java b/src/main/java/com/antesh/dsa/bst/BinarySearchTree.java
@@ -1,4 +1,4 @@
-package com.antesh.dsa;
+package com.antesh.dsa.bst;
 
 /*
  * https://www.javatpoint.com/binary-tree
diff --git a/src/main/java/com/antesh/dsa/bst/BinarySearchTreeInorderSuccessorOfInputNode.java b/src/main/java/com/antesh/dsa/bst/BinarySearchTreeInorderSuccessorOfInputNode.java
@@ -1,4 +1,4 @@
-package com.antesh.dsa;
+package com.antesh.dsa.bst;
 
 public class BinarySearchTreeInorderSuccessorOfInputNode {
 
diff --git a/src/main/java/com/antesh/dsa/bst/SortedArrayToBST.java b/src/main/java/com/antesh/dsa/bst/SortedArrayToBST.java
@@ -1,4 +1,4 @@
-package com.antesh.dsa;
+package com.antesh.dsa.bst;
 
 
 /*Given a sorted array, create a balanced BST and not skewed bst

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package com.antesh.dsa;`
	`1`	`+package com.antesh.dsa.bst;`
`2`	`2`
`3`	`3`	`/*`
`4`	`4`	`* https://www.javatpoint.com/binary-tree`