solves increasig bst

Author: anishLearnsToCode

Diff for: README.md

@@ -243,7 +243,7 @@
 | 892 | [Surface Area of 3D Shapes](https://leetcode.com/problems/surface-area-of-3d-shapes) | [![Java](assets/java.png)](src/SurfaceAreaOf3DShapes.java) |
 | 893 | [Groups of Special Equivalent Strings](https://leetcode.com/problems/groups-of-special-equivalent-strings) | |
 | 896 | [Monotonic Array](https://leetcode.com/problems/monotonic-array) | [![Java](assets/java.png)](src/MonotonicArray.java) |
-| 897 | [Increasing Order Search Tree](https://leetcode.com/problems/increasing-order-search-tree) | |
+| 897 | [Increasing Order Search Tree](https://leetcode.com/problems/increasing-order-search-tree) | [![Java](assets/java.png)](src/IncreasingOrderSearchTree.java) |
 | 905 | [Sort Array by Parity](https://leetcode.com/problems/sort-array-by-parity) | |
 | 908 | [Smallest Range I](https://leetcode.com/problems/smallest-range-i) | |
 | 914 | [X of a kind in a Deck of Cards](https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards) | |

Diff for: src/IncreasingOrderSearchTree.java

@@ -0,0 +1,19 @@
+public class IncreasingOrderSearchTree {
+    TreeNode current;
+
+    public TreeNode increasingBST(TreeNode root) {
+        if (root == null) return null;
+        TreeNode result = new TreeNode();
+        current = result;
+        inOrderTraversal(root);
+        return result.right;
+    }
+
+    private void inOrderTraversal(TreeNode root) {
+        if (root == null) return;
+        inOrderTraversal(root.left);
+        current.right = new TreeNode(root.val);
+        current = current.right;
+        inOrderTraversal(root.right);
+    }
+}