tree identical done

Author: Ram swaroop

src/me/ramswaroop/Main.java

@@ -13,7 +13,7 @@ public static void main(String[] args) {
         Scanner in = new Scanner(System.in);
         LinkedStack<Integer> stack = new LinkedStack<>();
         LinkedQueue<Integer> queue = new LinkedQueue<>();
-        firstLoop:
+        chooseModule:
         while (true) {
             Utils.println("Choose module:");
             Utils.println("==============");
@@ -52,7 +52,7 @@ public static void main(String[] args) {
                                 stack.print();
                                 break;
                             case 5:
-                                continue firstLoop;
+                                continue chooseModule;
                             default:
                                 Utils.println("Wrong choice!");
                         }
@@ -86,7 +86,7 @@ public static void main(String[] args) {
                                 queue.print();
                                 break;
                             case 5:
-                                continue firstLoop;
+                                continue chooseModule;
                             default:
                                 Utils.println("Wrong choice!");
                         }

src/me/ramswaroop/trees/BinaryTree.java

@@ -10,7 +10,28 @@
  * To change this template go to Preferences | IDE Settings | File and Code Templates
  */
 public class BinaryTree<E> extends Tree<E> {
+    BinaryNode<E> root;
+
     public static <E> boolean isIdentical(BinaryNode<E> node1, BinaryNode<E> node2) {
-        return false;
+        if (node1 == null && node2 == null) return true;
+        if (node1 == null && node2 != null || (node1 != null && node2 == null)) return false;
+
+        if (node1.value == node2.value) {
+            return true && isIdentical(node1.left, node2.left) && isIdentical(node1.right, node2.right);
+        } else {
+            return false;
+        }
+    }
+
+    public int height() {
+        return height(root);
+    }
+
+    public int height(BinaryNode<E> node) {
+        return 0;
+    }
+
+    public boolean isIdentical(BinaryNode<E> node) {
+        return isIdentical(this.root, node);
     }
 }

src/me/ramswaroop/trees/NonRecursiveBST.java

@@ -0,0 +1,12 @@
+package me.ramswaroop.trees;
+
+/**
+ * Created by IntelliJ IDEA.
+ * User: ramswaroop
+ * Date: 4/19/15
+ * Time: 11:41 PM
+ * To change this template go to Preferences | IDE Settings | File and Code Templates
+ */
+public class NonRecursiveBST<E extends Comparable<E>> extends BinarySearchTree<E> {
+
+}

src/me/ramswaroop/trees/RecursiveBST.java

@@ -10,9 +10,9 @@
  * Time: 3:02 PM
  * To change this template go to Preferences | IDE Settings | File and Code Templates
  */
-public class RecursiveBST<E extends Comparable<E>> extends Tree {
+public class RecursiveBST<E extends Comparable<E>> extends BinarySearchTree<E> {
 
-    BinaryNode root;
+    //BinaryNode<E> root;
 
     public static void main(String[] a) {
         RecursiveBST obj = new RecursiveBST();
@@ -26,6 +26,8 @@ public static void main(String[] a) {
         obj.print("\n");
         obj.postOrder();
         Utils.println("\n" + obj.size());
+        Utils.println(BinaryTree.isIdentical(obj.root.right, obj.root.right));
+        Utils.println(obj.isIdentical(obj.root));
     }
 
     /**