public static void q6(String[] args) throws Exception{
        //Question 4.6: Write an algorithm to find the 'next' node (i.e., in order successor) of a given node in
        //a binary search tree. You may assume that each node has a link to its parent.
        SOP("Running q6");
        if(args.length != 1){
            SOP("This question takes no parameters");
            return;
        }

        bNode mBinarySearchTree = generateSampleBinarySearchTree1();

        for(int i = 1; i<=7; i++){
            bNode result = findNextInOrderSucessor(mBinarySearchTree, i);
            if(result != null){
                SOP("The next node for ["+i+"] is [" + result.data +"]");
                if(result.data == (i+1) ) SOP("Function CORRECT");
                else SOP("Function INCORRECT");
            }
            else{
                SOP("The next node for ["+i+"] is null");
                if(i==7) SOP("Function CORRECT");
                else SOP("Function INCORRECT");
            }
        }
    }