binary tree preorder iterator

Author: xiaoningning

PuzzleCoding/src/BTreeIterator.java

@@ -30,12 +30,12 @@ public void remove() {
         throw new java.lang.UnsupportedOperationException("remove");
     }
 
-    public Node inOrderNext() {
-        return next();
+    public Node next() {
+        return inOrderNext();
     }
 
     // in-order
-    public Node next() {
+    public Node inOrderNext() {
         if (hasNext()) {
             Node node = stack.pop();
             pushLeft(node.right);