From 2051c266fe8e7a8104454c702506ce0050154106 Mon Sep 17 00:00:00 2001
From: Wasif Hussain <95441107+Wasif0787@users.noreply.github.com>
Date: Sun, 16 Oct 2022 21:19:32 +0530
Subject: [PATCH] Add files via upload

---
 .../BinarySearchTree$Node.class               | Bin 0 -> 500 bytes
 .../Binary Search Tree/BinarySearchTree.class | Bin 0 -> 1291 bytes
 java/Binary Search Tree/BinarySearchTree.java |  90 ++++++++++++++++++
 3 files changed, 90 insertions(+)
 create mode 100644 java/Binary Search Tree/BinarySearchTree$Node.class
 create mode 100644 java/Binary Search Tree/BinarySearchTree.class
 create mode 100644 java/Binary Search Tree/BinarySearchTree.java

diff --git a/java/Binary Search Tree/BinarySearchTree$Node.class b/java/Binary Search Tree/BinarySearchTree$Node.class
new file mode 100644
index 0000000000000000000000000000000000000000..45d5efaac18d42ebb38c8bfe1d1afc939adb64e1
GIT binary patch
literal 500
zcmZWl%T5A85Uk;~u&%J6ycF>f4zMQT9q}NEk%Zs@!ok~s0}QT9GP{`YSspef9{d15
z%Gk3<I81kXrfRCHfB(LJ0CaJcK@4#N2@6T27>W<l<7zt+T+NnaB}8MmeiaO<U@85^
zEkj|ji|Ck0BV)j{Z~%+JUhxm!cDc7`KTlU;77+VRdNR0Yh&Njkt(ditgH7|B*fOxb
zzAIQb!ZAZq$;FaL<vpdyOGjf%7Rnl%aK)UUrRE;C({D}ay%)L94WuWAoA;?uV?K2$
zk2zXz)J!}|J?w?P(GeKZL*WNcYd<h>PPul2Ggy7k6RPKO-xofq>0RN1{H1BR2|5&#
zDzw?CQ$WDB^{#2A<g~I1)hbP0V#KLeo$C<H`GVopLL52{dkK*bQT&W3CsYg3=UHS(
cAWISz<cWGpFEP|`7WFzA0ZjTlhB_{Re?xj<U;qFB

literal 0
HcmV?d00001

diff --git a/java/Binary Search Tree/BinarySearchTree.class b/java/Binary Search Tree/BinarySearchTree.class
new file mode 100644
index 0000000000000000000000000000000000000000..47e08bcb0e046852f62ddd462af713ef6a90caea
GIT binary patch
literal 1291
zcmZ`%T~8B16g@)=OUo829|a3VMAUW{so=LQAd--f)KV!yiBC%zVYO_@b}`|_A7e~>
zRih=5#79m1QN}aVO^kpKy`8;t&b?>Oy}y2c`wn0pOL24{Vjyaw6I}wySI!$JUw6FS
z{Mz;_SqlWZimvAd3j&dBZZn2%#0<nu^uQ$ivFkbhQB^vAZEwSuQXuL#8e|QZPG3!x
z8#}UKpjTk%+`BjuNGcr{1X9^E{K9H(GtTw{CI&Gi5Ockz^n-O-6PP^<Z?{{`ovG8l
zh_TtQi4k1n!(PiH0kNubqbA1G%c6DpGEj+e6PHw?(|33G0wv(GiAh`$h`V0H-;usn
zkp7<n<=ItSGjQER7P)^ct{yc5xlaL&Ls~Xe(&oF3e8qRYpc?qn*)POlW7@zC6EnyQ
z44i`zFb))>?ooF(v?-#b&Y8HSSY2(eRO*h2yK2%#sGgK%4o0A_<a)AvxW6s^4QIQ~
zOrjb%wbxIagYY}L@3?G{%D!kT)oVhTuD4srZPJix<Iu0k6<3kZ%y>pA7w9R=X7EI+
zHcbI@)$^pkTz8sH$<L_T5lm2K2iH^Z$2DU#_~U*ubC0J<-m1H}bqryNuP{FGOW;1E
z!hmB{_<V@BcvkiLHU0#NEo<}`edqAfMA5L2cMVa^>$NQF3yjeg`p@BH$l*eUoVVme
zm|3)cqEELPW2=(=am@aL)H@8=77yt$T`T<oBRc;cNuAHM^BMaiOLXW5P0|cNNx6<*
zZcq}_eBKS7W^j{I=P`!|M06sO93JF>(+#y;4t<Jg`7KPGw&^b6T;&j6AzayX$^L<i
zR!PcdOex_lSSphVi?pSs*c2#I+B~PUfD{%njwLN80x^yl9-<IdZ-&+HouGT`7&l9H
za;}A0J2|f7ppID`S9C1uSW&Ts+kd57h_mYoZ7I``HF{q`8c(@3>$Is#dp2mvGy3qH
YlPD6~L46DSk5Wp48o4?8)Qv~LANU;Zy#N3J

literal 0
HcmV?d00001

diff --git a/java/Binary Search Tree/BinarySearchTree.java b/java/Binary Search Tree/BinarySearchTree.java
new file mode 100644
index 0000000..88e5295
--- /dev/null
+++ b/java/Binary Search Tree/BinarySearchTree.java	
@@ -0,0 +1,90 @@
+// Java program to demonstrate
+// insert operation in binary
+// search tree
+class BinarySearchTree {
+
+	/* Class containing left
+	and right child of current node
+	* and key value*/
+	class Node {
+		int key;
+		Node left, right;
+
+		public Node(int item)
+		{
+			key = item;
+			left = right = null;
+		}
+	}
+
+	// Root of BST
+	Node root;
+
+	// Constructor
+	BinarySearchTree() { root = null; }
+
+	BinarySearchTree(int value) { root = new Node(value); }
+
+	// This method mainly calls insertRec()
+	void insert(int key) { root = insertRec(root, key); }
+
+	/* A recursive function to
+	insert a new key in BST */
+	Node insertRec(Node root, int key)
+	{
+
+		/* If the tree is empty,
+		return a new node */
+		if (root == null) {
+			root = new Node(key);
+			return root;
+		}
+
+		/* Otherwise, recur down the tree */
+		else if (key < root.key)
+			root.left = insertRec(root.left, key);
+		else if (key > root.key)
+			root.right = insertRec(root.right, key);
+
+		/* return the (unchanged) node pointer */
+		return root;
+	}
+
+	// This method mainly calls InorderRec()
+	void inorder() { inorderRec(root); }
+
+	// A utility function to
+	// do inorder traversal of BST
+	void inorderRec(Node root)
+	{
+		if (root != null) {
+			inorderRec(root.left);
+			System.out.println(root.key);
+			inorderRec(root.right);
+		}
+	}
+
+	// Driver Code
+	public static void main(String[] args)
+	{
+		BinarySearchTree tree = new BinarySearchTree();
+
+		/* Let us create following BST
+			50
+		/	 \
+		30	 70
+		/ \ / \
+	20 40 60 80 */
+		tree.insert(50);
+		tree.insert(30);
+		tree.insert(20);
+		tree.insert(40);
+		tree.insert(70);
+		tree.insert(60);
+		tree.insert(80);
+
+		// print inorder traversal of the BST
+		tree.inorder();
+	}
+}
+// This code is contributed by Ankur Narain Verma