public boolean searchInBlissTree(int findThis)
    {
        boolean found = false;
        TreeNode currentNodeSearch;
        TreeNode previousNodeSearch;

        currentNodeSearch = rootBliss;
        previousNodeSearch = rootBliss;

        //while there are nodes in the tree and the node has not been found
        while (currentNodeSearch != null && !found)
        {

            //if a match is found
            if (currentNodeSearch.getBliss() == findThis)
            {
                //break from loop
                found = true;
            }
            else if (findThis < currentNodeSearch.getBliss())
            {
                //keeping track of previous
                previousNodeSearch = currentNodeSearch;

                //if it is smaller than the surrent node go left
                currentNodeSearch = currentNodeSearch.getLeft(); 
            }
            else if (findThis > currentNodeSearch.getBliss())
            {
                //keep track of previous
                previousNodeSearch = currentNodeSearch;

                //if it is larger than the current node go right
                currentNodeSearch = currentNodeSearch.getRight();
            }
        }

        //returning true if it was found and false if not
        if (found == true)
        {
            foundInfo=currentNodeSearch.printInfoBliss();
            return true;
        }
        else
        {
            return false;
        }

    }