#include <iostream>
#include <cstddef> // For NULL
#include <string.h>
using namespace std;
const int arraySize = 80; //initilize size of the array

bool isBST(char [], int i);
int main ()
{
	
	char binaryTree[arraySize]; //create array binaryTree
	bool flag = true;
	int i=0;
	cout <<"Please enter a string of characters: " << endl;
	cin.getline(binaryTree, arraySize, '\n');
	for (int i=0; binaryTree[i] !='\n'; i++){//loop to convert lowercase to uppercase characters
		if (binaryTree[i] >=65 && binaryTree[i] <= 90)
			binaryTree[i]+=32;
			cout<< binaryTree[i];//print the uppercase characters
	}
	flag == isBST(binaryTree, i);
	
	if (flag == true)
		//cout << endl << "Yes, it is a binary search tree.";
	else
		cout << endl << "No, it is not a binary search tree.";

	return 0;

}
bool isBST(char binaryTree [], int i)
{
	for (int i=0; i < arraySize-1; i++){
		if(binaryTree[i] < binaryTree [2*i+1]){
			return false;

			if (binaryTree[2*i+2] < binaryTree[i]){
				return false;
			}
		}
		return isBST((binaryTree, 2*i+1) && isBST(binaryTree, 2*i+2));
	}
}

(binaryTree, 2*i+1) && isBST(binaryTree, 2*i+2)

return isBST(binaryTree, 2*i+1) && isBST(binaryTree, 2*i+2);

return (isBST(binaryTree, 2*i+1) && isBST(binaryTree, 2*i+2));