"is it binary search tree" done!

This is not too bad. Since I got the tree traversal done in the last
exercise, I just used the in-order traversal as a base and modified a
bit.

1 files changed, 96 insertions, 0 deletions

diff --git a/src/main/TreeBstCheck.java b/src/main/TreeBstCheck.java
new file mode 100644
index 0000000..51f33c4
--- /dev/null
+++ b/src/main/TreeBstCheck.java
@@ -0,0 +1,96 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.*;
+
+public class TreeBstCheck {
+    static class FastScanner {
+        StringTokenizer tok = new StringTokenizer("");
+        BufferedReader in;
+
+        FastScanner() {
+            in = new BufferedReader(new InputStreamReader(System.in));
+        }
+
+        String next() throws IOException {
+            while (!tok.hasMoreElements())
+                tok = new StringTokenizer(in.readLine());
+            return tok.nextToken();
+        }
+
+        int nextInt() throws IOException {
+            return Integer.parseInt(next());
+        }
+    }
+
+    static class TreeOrders {
+        int n;
+        int[] key, left, right;
+
+        void read() throws IOException {
+            FastScanner in = new FastScanner();
+            n = in.nextInt();
+            key = new int[n];
+            left = new int[n];
+            right = new int[n];
+            for (int i = 0; i < n; i++) {
+                key[i] = in.nextInt();
+                left[i] = in.nextInt();
+                right[i] = in.nextInt();
+            }
+        }
+
+        boolean isBst() {
+            if (key.length == 0) return true;
+            Stack<Integer> keyIndexStack = new Stack<>();
+            ArrayList<Integer> result = new ArrayList<>();
+            boolean walkLeft = true;
+            int currentIndex = 0;
+            keyIndexStack.push(currentIndex);
+            while (!keyIndexStack.empty() || right[currentIndex] != -1) {
+                if (walkLeft) {
+                    if (left[currentIndex] != -1) {
+                        if (key[left[currentIndex]] >= key[currentIndex]) return false;
+                        currentIndex = left[currentIndex];
+                        keyIndexStack.push(currentIndex);
+                    } else {
+                        int i = keyIndexStack.pop();
+                        if (result.size() > 0) {
+                            if (key[i] <= result.get(result.size()-1)) return false;
+                        }
+                        result.add(key[i]);
+                        walkLeft = false;
+                    }
+                } else {
+                    if (right[currentIndex] != -1) {
+                        if (key[right[currentIndex]] <= key[currentIndex]) return false;
+                        currentIndex = right[currentIndex];
+                        keyIndexStack.push(currentIndex);
+                        walkLeft = true;
+                    } else {
+                        if (!keyIndexStack.empty()) {
+                            currentIndex = keyIndexStack.pop();
+                            if (result.size() > 0) {
+                                if (key[currentIndex] <= result.get(result.size()-1)) return false;
+                            }
+                            result.add(key[currentIndex]);
+                        }
+                    }
+                }
+            }
+            return true;
+        }
+
+    }
+
+    static public void main(String[] args) throws IOException {
+        TreeOrders tree = new TreeOrders();
+        tree.read();
+        if (tree.isBst()) {
+            System.out.println("CORRECT");
+        } else
+            System.out.println("INCORRECT");
+
+    }
+
+}