# (Solved Homework): Write an algorithm that a given Binary tree is a binary search tree. NOTE: please submit code with at least three (3) test cases in C++

Write an algorithm that a given Binary tree is a binary search tree.

NOTE: please submit code with at least three (3) test cases in C++

#include <iostream>

#include <limits.h>
#include <stdlib.h>
#include <iomanip>

using namespace std;

/* Struct to declare the node for Binary tree */
struct node
{
int data;
struct node* left;
struct node* right;
};

/* Recursive function to check if the tree is BST */
int isSearchTreeUtil(struct node* root, int min, int max)
{
/* If node is empty, its a valid tree */
if (root==NULL)
return 1;

/* If the data of the root is not under the min/max constraints */
if (root->data < min || root->data > max)
return 0;

/*
This node is fine, recursively check for left and right half, and then return result
Left half will have values lesser while right half will have larger values as compared
to the root node
*/
return
isSearchTreeUtil(root->left, min, root->data-1) &&
isSearchTreeUtil(root->right, root->data+1, max);
}

/* Check if Binary Tree is a binary search tree */
int isSearchTree(struct node* node)
{
// The minimum in the tree can be -infinity, and max can be +infinity
// we define infinity here using INT_MIN and INT_MAX
return(isSearchTreeUtil(node, INT_MIN, INT_MAX));
}

/* Function to create new tree node */
struct node* createNode(int data)
{
struct node* node = (struct node*) malloc(sizeof(struct node));
node->data = data;
node->left = NULL;
node->right = NULL;

return(node);
}

void printTree(struct node* root, int space)
{
// Base case
if (root == NULL)
return;

// Increase distance between levels
space += 1;

// Process right child first
printTree(root->right, space);

// Print current node after space
// count
int i;
for ( i = 1; i < space; i++)
cout << ” “;
cout << root->data << endl;

// Process left child
printTree(root->left, space);
}

/* Driver program to test*/
int main()
{
// Create a tree
struct node *root = createNode(4);
root->left = createNode(2);
root->right = createNode(5);
root->left->left = createNode(1);
root->left->right = createNode(3);

printTree(root, 0);

if(isSearchTree(root))
cout << “Is BST” << endl;
else
cout << “Not a BST” << endl;

cout << “nAdding One node 15 and printing tree: n”;
root->right->left = createNode(15);
printTree(root, 0);
if(isSearchTree(root))
cout << “Is BST” << endl;
else
cout << “Not a BST” << endl;

cout << “nChanging value of node with 15 to 18 and printing tree: n”;
root->right->data = 18;
printTree(root, 0);
if(isSearchTree(root))
cout << “Is BST” << endl;
else
cout << “Not a BST” << endl;

return 0;
}

Order NOW for a 10% Discount
Pages (550 words)
Approximate price: -

Why Us?

Top Quality and Well-Researched Papers

All ourbpapers are written from scratch. In fact, Clients who ask for paraphrasing services are highly discouraged. We have writers ready to craft any paper from scratch and deliver quality ahead of time.

Our writers keeps you posted on your papers progress - providing you with paper outline/draft. You are also at liberty to communicate directly with your writer.

Free Unlimited Revisions

If you think we missed something, send your order for a free revision. You have 10 days to submit the order for review after you have received the final document. You can do this yourself after logging into your personal account or by contacting our support.

Prompt Delivery and 100% Money-Back-Guarantee

All papers are always delivered on time, in many cases quite ahead of time. In case we need more time to master your paper, we may contact you regarding the deadline extension. In case you cannot provide us with more time, a 100% refund is guaranteed.

Original & Confidential

We use several writing tools checks to ensure that all documents you receive are free from plagiarism. Our editors carefully review all quotations in the text. We also promise maximum confidentiality in all of our services.

Our support agents are available 24 hours a day 7 days a week and committed to providing you with the best customer experience. Get in touch whenever you need any assistance.

Try it now!

## Calculate the price of your order

Total price:
\$0.00

How it works?

Fill in the order form and provide all details of your assignment.

Proceed with the payment

Choose the payment system that suits you most.

Our Services

No need to work on your paper at night. Sleep tight, we will cover your back. We offer all kinds of writing services.

## Essay Writing Service

No matter what kind of academic paper you need and how urgent you need it, you are welcome to choose your academic level and the type of your paper at an affordable price. We take care of all your paper needs and give a 24/7 customer care support system.