/*
 * Copyright (C) 2014 Pedro Vicente Gómez Sánchez.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 * http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package com.github.pedrovgs.app.problem15;

import com.github.pedrovgs.app.binarytree.BinaryNode;
import java.util.LinkedList;
import java.util.List;
import java.util.Stack;

/**
 * Given a binary tree, can you write a method to get a List<BinaryNode> using a in order
 * traversal?
 *
 * @author Pedro Vicente Gómez Sánchez.
 */
public class BinaryTreeInOrder {

  /**
   * Recursive implementation of this binary tree traversal. The complexity order of this
   * algorithms in time terms is O(N) and O(N) in space terms because we are using one additional
   * data structure to return the result.
   */
  public List<BinaryNode> getRecursive(BinaryNode<Integer> root) {
    if (root == null) {
      throw new IllegalArgumentException("You can't pass a null BinaryNode.");
    }
    return getInner(root);
  }

  private List<BinaryNode> getInner(BinaryNode<Integer> root) {
    List<BinaryNode> result = new LinkedList<BinaryNode>();
    if (root != null) {
      result.addAll(getInner(root.getLeft()));
      result.add(root);
      result.addAll(getInner(root.getRight()));
    }
    return result;
  }

  /**
   * Iterative implementation of this binary tree traversal. The complexity order in time terms of
   * this algorithm is O(N) where N is the number of nodes in the tree. In space terms the
   * complexity order of this algorithm is also O(N) where N is the number of nodes we have to
   * store in the auxiliary data structure, the stack.
   */
  public List<BinaryNode> getIterative(BinaryNode<Integer> root) {
    if (root == null) {
      throw new IllegalArgumentException("You can't pass a null BinaryNode.");
    }
    List<BinaryNode> result = new LinkedList<BinaryNode>();
    Stack<BinaryNode> stack = new Stack<BinaryNode>();
    //Define a pointer to track nodes
    BinaryNode current = root;
    while (!stack.empty() || current != null) {
      if (current != null) {
        //If it is not null, push to stack and go down the tree to left
        stack.push(current);
        current = current.getLeft();
      } else {
        //If no left child pop stack, process the node then let current point to the right
        BinaryNode node = stack.pop();
        result.add(node);
        current = node.getRight();
      }
    }
    return result;
  }
}

@@ -1256,33 +1256,24 @@
 e(BinaryNode
-%3CInteger%3E
  root) %7B%0A   
@@ -1277,112 +1277,34 @@
     
-if (root == null) %7B%0A      throw new IllegalArgumentException(%22You can't pass a null BinaryNode.%22);%0A    %7D
+validateBinaryNode(root);%0A
 %0A   
@@ -1374,33 +1374,24 @@
 r(BinaryNode
-%3CInteger%3E
  root) %7B%0A   
@@ -2025,17 +2025,8 @@
 Node
-%3CInteger%3E
  roo
@@ -2038,112 +2038,34 @@
     
-if (root == null) %7B%0A      throw new IllegalArgumentException(%22You can't pass a null BinaryNode.%22);%0A    %7D
+validateBinaryNode(root);%0A
 %0A   
@@ -2703,10 +2703,180 @@
 lt;%0A  %7D%0A
+  %0A  private void validateBinaryNode(BinaryNode root) %7B%0A    if (root == null) %7B%0A      throw new IllegalArgumentException(%22You can't pass a null BinaryNode.%22);%0A    %7D%0A  %7D%0A%0A
 %7D%0A

Clean code for problem 15