From a2622dc90736c0fc6036d60964add4e47a8c4964 Mon Sep 17 00:00:00 2001
From: Ashutosh <70135665+Ashutosh-Ray@users.noreply.github.com>
Date: Mon, 3 Oct 2022 21:02:32 +0530
Subject: [PATCH 1/3] Binary_Tree_Inorder_Traversal

---
 .../java/binaryTreeInorderTravesal.java       | 52 +++++++++++++++++++
 1 file changed, 52 insertions(+)
 create mode 100644 data_structures/binary_tree/java/binaryTreeInorderTravesal.java

diff --git a/data_structures/binary_tree/java/binaryTreeInorderTravesal.java b/data_structures/binary_tree/java/binaryTreeInorderTravesal.java
new file mode 100644
index 00000000..f6fc20e7
--- /dev/null
+++ b/data_structures/binary_tree/java/binaryTreeInorderTravesal.java
@@ -0,0 +1,52 @@
+import java.util.*;
+
+class Node {
+    int data;
+    Node left, right;
+    Node(int data) {
+        this.data = data;
+        left = null;
+        right = null;
+    }
+}
+class binaryTreeInorderTravesal {
+    static ArrayList < Integer > inOrderTrav(Node curr) {
+        ArrayList < Integer > inOrder = new ArrayList < > ();
+        Stack < Node > s = new Stack < > ();
+        while (true) {
+            if (curr != null) {
+                s.push(curr);
+                curr = curr.left;
+            } else {
+                if (s.isEmpty()) break;
+                curr = s.peek();
+                inOrder.add(curr.data);
+                s.pop();
+                curr = curr.right;
+            }
+        }
+        return inOrder;
+    }
+
+    public static void main(String args[]) {
+
+        Node root = new Node(1);
+        root.left = new Node(2);
+        root.right = new Node(3);
+        root.left.left = new Node(4);
+        root.left.right = new Node(5);
+        root.left.right.left = new Node(8);
+        root.right.left = new Node(6);
+        root.right.right = new Node(7);
+        root.right.right.left = new Node(9);
+        root.right.right.right = new Node(10);
+
+        ArrayList < Integer > inOrder;
+        inOrder = inOrderTrav(root);
+
+        System.out.println("The inOrder Traversal is : ");
+        for (int i = 0; i < inOrder.size(); i++) {
+            System.out.print(inOrder.get(i) + " ");
+        }
+    }
+}

From 30dd158e144863a66b95092aafada2900dd9f107 Mon Sep 17 00:00:00 2001
From: Ashutosh <70135665+Ashutosh-Ray@users.noreply.github.com>
Date: Mon, 3 Oct 2022 21:03:28 +0530
Subject: [PATCH 2/3] Update and rename binaryTreeInorderTravesal.java to
 binary_tree_inorder_travesal.java

---
 ...eeInorderTravesal.java => binary_tree_inorder_travesal.java} | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)
 rename data_structures/binary_tree/java/{binaryTreeInorderTravesal.java => binary_tree_inorder_travesal.java} (97%)

diff --git a/data_structures/binary_tree/java/binaryTreeInorderTravesal.java b/data_structures/binary_tree/java/binary_tree_inorder_travesal.java
similarity index 97%
rename from data_structures/binary_tree/java/binaryTreeInorderTravesal.java
rename to data_structures/binary_tree/java/binary_tree_inorder_travesal.java
index f6fc20e7..de30db1a 100644
--- a/data_structures/binary_tree/java/binaryTreeInorderTravesal.java
+++ b/data_structures/binary_tree/java/binary_tree_inorder_travesal.java
@@ -9,7 +9,7 @@ class Node {
         right = null;
     }
 }
-class binaryTreeInorderTravesal {
+class binary_tree_inorder_travesal {
     static ArrayList < Integer > inOrderTrav(Node curr) {
         ArrayList < Integer > inOrder = new ArrayList < > ();
         Stack < Node > s = new Stack < > ();

From f1eace9eb61a06efe8c1d14444ee2b28ee0a8bfe Mon Sep 17 00:00:00 2001
From: Ashutosh <70135665+Ashutosh-Ray@users.noreply.github.com>
Date: Mon, 3 Oct 2022 21:04:38 +0530
Subject: [PATCH 3/3] Update and rename binary_tree_inorder_travesal.java to
 binary_tree_inorder_traversal.java

---
 ...inorder_travesal.java => binary_tree_inorder_traversal.java} | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)
 rename data_structures/binary_tree/java/{binary_tree_inorder_travesal.java => binary_tree_inorder_traversal.java} (96%)

diff --git a/data_structures/binary_tree/java/binary_tree_inorder_travesal.java b/data_structures/binary_tree/java/binary_tree_inorder_traversal.java
similarity index 96%
rename from data_structures/binary_tree/java/binary_tree_inorder_travesal.java
rename to data_structures/binary_tree/java/binary_tree_inorder_traversal.java
index de30db1a..e6e6179d 100644
--- a/data_structures/binary_tree/java/binary_tree_inorder_travesal.java
+++ b/data_structures/binary_tree/java/binary_tree_inorder_traversal.java
@@ -9,7 +9,7 @@ class Node {
         right = null;
     }
 }
-class binary_tree_inorder_travesal {
+public class binary_tree_inorder_traversal {
     static ArrayList < Integer > inOrderTrav(Node curr) {
         ArrayList < Integer > inOrder = new ArrayList < > ();
         Stack < Node > s = new Stack < > ();