check logics

Author: Mengyi Zhou

homework/src/main/java/com/offline/training/homework/hw6/dict/Tree234.java

@@ -129,13 +129,19 @@ public void insert(int key, Tree234Node node) {
 			  return;
 	  }
 
-	  if(key < targetNode.key1) {
+	  if (key < targetNode.key1) {
 		  targetNode.key3 = targetNode.key2;
 		  targetNode.key2 = targetNode.key1;
 		  targetNode.key1 = key;
+	  } else if (key == targetNode.key1) {
+		  return;
 	  } else if(targetNode.keys == 1 || key < targetNode.key2){
 		  targetNode.key3 = targetNode.key2;
 		  targetNode.key2 = key;
+	  } else if (key == targetNode.key2) {
+		  return;
+	  } else if (key == targetNode.key3) {
+		  return;
 	  } else {
 		  targetNode.key3 = key;
 	  }
@@ -184,9 +190,6 @@ private Tree234Node split(Tree234Node node) {
 		  return root;
 	  }
 
-	  if (node.parent.isFull())
-		  split(node.parent);
-
 	  // here parent is guaranteed to be not full
 	  Tree234Node parent = node.parent;
 	  switch (parent.keys) {
@@ -372,8 +375,20 @@ public static void main(String[] args) {
     t.testHelper("(((1 4)7(11 16))22((23)28(37 49)))50(((51)60(66)75" +
                  "(80 81))84((86)95(99 100)))");
 
+    testDuplicate(t);
+
     System.out.println("\nFinal tree:");
     t.printTree();
   }
 
+  private static void testDuplicate(Tree234 t) {
+	  String origin = t.toString();
+	  System.out.println("\nDuplicating 80, 50, 37, 1.");
+	  t.insert(80);
+	  t.insert(50);
+	  t.insert(37);
+	  t.insert(1);
+	  t.testHelper(origin);
+  }
+
 }