Bst improvisation

cs-cse · cs-cse · commit 5a8b8aef0c24 · 2022-02-28T19:57:04.000+05:30
diff --git a/dsa-BinaryTree/src/BinarySearchTree.java b/dsa-BinaryTree/src/BinarySearchTree.java
@@ -56,6 +56,11 @@ public boolean isValid(TreeNode root, long min, long max) {
 
 
     public static void main(String[] args) {
+            BinarySearchTree bst=new BinarySearchTree();
+            bst.insert(bst.root, 14);
+        bst.insert(bst.root, 24);
+        bst.insert(bst.root, 34);
+        bst.insert(bst.root, 44);
 
     }
 }

Original file line number	Diff line number	Diff line change
`@@ -56,6 +56,11 @@ public boolean isValid(TreeNode root, long min, long max) {`
`56`	`56`
`57`	`57`
`58`	`58`	`public static void main(String[] args) {`
	`59`	`+ BinarySearchTree bst=new BinarySearchTree();`
	`60`	`+ bst.insert(bst.root, 14);`
	`61`	`+ bst.insert(bst.root, 24);`
	`62`	`+ bst.insert(bst.root, 34);`
	`63`	`+ bst.insert(bst.root, 44);`
`59`	`64`
`60`	`65`	`}`
`61`	`66`	`}`