import java.util.ArrayList;
import java.util.List;

/**
 * @author Dipl. Ing. Clemens Schartmüller, Technische Hochschule Ingolstadt
 * @version 21.05.2019
 * @since 21.05.2019
 **/
public class Example {

    public class Node {
        private Object data;
        Node left;
        Node right;
    }

    public class BinaryTree{
        Node root;

        public Object findBFS(Object searchTerm){
            //return findBFSHelper(searchTerm, root);

            List<Node> nodeList = new ArrayList<Node>();
            nodeList.add(root);
            while(nodeList.size() > 0) {
                Node current = nodeList.get(0);
                if (current.data == searchTerm) {
                    return current.data;
                }
                nodeList.remove(0);

                nodeList.add(current.left);
                nodeList.add(current.right);
            }
            return null; // element not found
        }

       /* private Object findBFSHelper(Object searchTerm, Node current){
            if(current.data == searchTerm){
                return current.data;
            }

            if(current.left != null){
                Object result = findBFSHelper(searchTerm, current.left);
                if(result != null)return result;
            }

            if(current.right!= null){
                Object result = findBFSHelper(searchTerm, current.right);
                if(result != null)return result;
            }
            return null;


        }*/
    }
}