Core Java Projects Using Multi Threading

code/Core Java Projects Using Multi Threading/Company.java

@@ -0,0 +1,24 @@
+public class Company {
+	int n = 0;
+	boolean flag = true;
+
+	synchronized public void produceItem(int n) throws Exception {
+		if (!flag) {
+			wait();
+		}
+		this.n = n;
+		System.out.println("Item : " + n + " Produced");
+		flag = false;
+		notify();
+	}
+
+	synchronized public int consumeItem() throws Exception {
+		if (flag) {
+			wait();
+		}
+		System.out.println("Item : " + n + " Consumed");
+		notify();
+		flag = true;
+		return this.n;
+	}
+}

code/Core Java Projects Using Multi Threading/Consumer.java

@@ -0,0 +1,18 @@
+public class Consumer extends Thread {
+	Company c;
+
+	Consumer(Company c) {
+		this.c = c;
+	}
+
+	public void run() {
+		while (true) {
+
+			try {
+				this.c.consumeItem();
+				Thread.sleep(3000);
+			} catch (Exception e) {
+			}
+		}
+	}
+}

code/Core Java Projects Using Multi Threading/Main.java

@@ -0,0 +1,9 @@
+class Main{
+	public static void main(String args[]){
+		Company c= new Company();
+		Producer p= new Producer(c);
+		Consumer cc = new Consumer(c);
+		p.start();
+		cc.start();
+	}
+}

code/Core Java Projects Using Multi Threading/Producer.java

@@ -0,0 +1,23 @@
+public class Producer extends Thread {
+	Company c;
+
+	Producer(Company c) {
+		this.c = c;
+	}
+
+	public void run() {
+		int i = 1;
+		while (true) {
+			try {
+				this.c.produceItem(i);
+			} catch (Exception e) {
+			}
+			i++;
+			try {
+				Thread.sleep(1000);
+			} catch (Exception e) {
+
+			}
+		}
+	}
+}

code/GFG Hard Questions/AVL Tree Deletion/README.md

@@ -0,0 +1,48 @@
+<h2><a href="https://practice.geeksforgeeks.org/problems/avl-tree-deletion/1">AVL Tree Deletion</a></h2><h3>Difficulty Level : Hard</h3><hr><div class="problems_problem_content__Xm_eO"><p><span style="font-size: 18px;">Given an <strong>AVL tree</strong> and <strong>N</strong> values to be deleted from the tree. Write a function to delete a given value from the tree. All the <strong>N</strong> values which needs to be deleted are passed one by one as input <strong>data </strong>by driver code itself, you are asked to return the root of modified tree after deleting the value.</span></p>
+<pre><span style="font-size: 18px;"><strong>Example 1:
+</strong>
+Tree = 
+        4
+      /   \
+     2     6
+    / \   / \  
+   1   3 5   7</span>
+
+<span style="font-size: 18px;">N = 4
+Values to be deleted = {4,1,3,6}</span>
+
+<span style="font-size: 18px;"><strong>Input: </strong>Value to be deleted = 4
+<strong>Output:</strong>
+        5    
+      /   \
+     2     6
+    / \     \  
+   1   3     7</span>
+
+<span style="font-size: 18px;"><strong>Input: </strong>Value to be deleted = 1
+<strong>Output:</strong>
+        5    
+      /   \
+     2     6
+      \     \  
+       3     7</span>
+
+<span style="font-size: 18px;"><strong>Input: </strong>Value to be deleted = 3
+<strong>Output:</strong>
+        5    
+      /   \
+     2     6
+            \  
+             7</span>
+
+<span style="font-size: 18px;"><strong>Input: </strong>Value to be deleted = 6
+<strong>Output:</strong>
+        5    
+      /   \
+     2     7</span>
+
+</pre>
+<p><span style="font-size: 18px;"><strong>Your Task: &nbsp;</strong><br>You dont need to read input or print anything. Complete the function<strong> delelteNode()</strong> which takes the root of the tree and the value of the node to be deleted as input parameters and returns the root of the modified tree.</span></p>
+<p><span style="font-size: 18px;"><strong>Note:&nbsp;</strong>The tree will be checked after each deletion.&nbsp;<br>If it violates the properties of balanced BST, an error message will be printed followed by the inorder traversal of the tree at that moment.<br>If instead all deletion are successful, inorder traversal of tree will be printed.<br>If every single node is deleted from tree, 'null' will be printed.</span></p>
+<p><span style="font-size: 18px;"><strong>Expected Time Complexity:</strong> O(height of tree)<br><strong>Expected Auxiliary Space: </strong>O(height of tree)</span></p>
+<p><span style="font-size: 18px;"><strong>Constraints:</strong><br>1 ≤ N ≤ 500</span></p></div><p><span style=font-size:18px><strong>Company Tags : </strong><br><code>Morgan Stanley</code>&nbsp;<code>Amazon</code>&nbsp;<code>Snapdeal</code>&nbsp;<code>MakeMyTrip</code>&nbsp;<code>Oracle</code>&nbsp;<code>Oxigen Wallet</code>&nbsp;<br><p><span style=font-size:18px><strong>Topic Tags : </strong><br><code>Tree</code>&nbsp;<code>AVL-Tree</code>&nbsp;<code>Data Structures</code>&nbsp;<code>Advanced Data Structure</code>&nbsp;