Answer Happy

In This lab we have studied the formation and creation
of Binary Search Trees, In theory, we have seen
why Binary Search Trees are so important and so efficient
is because the data structure which has to be created is already
managed in a way where the left child of the tree should be always
lesser than is a parent and the right child of the tree should be
always greater than his parent.
Now your task is to search for an element where you have
to take input from the users.
// Binary Search Tree - Implemenation in C++
// Simple program to create a BST of integers and search an element
in it
#include<iostream>
using namespace std;
//Definition of Node for Binary search tree
struct BstNode {
int data;
BstNode* left;
BstNode* right;
};
// Function to create a new Node in heap
BstNode* GetNewNode(int data) {
BstNode* newNode = new BstNode();
newNode->data = data;
newNode->left = newNode->right =
NULL;
return newNode;
}
// To insert data in BST, returns address of root
node
BstNode* Insert(BstNode* root,int data) {
if(root == NULL) { // empty tree
root =
GetNewNode(data);
}
// if data to be inserted is lesser, insert in
left subtree.
else if(data <= root->data) {
root->left =
Insert(root->left,data);
}
// else, insert in right subtree.
else {
root->right =
Insert(root->right,data);
}
return root;
}
//To search an element in BST, returns true if element is
found
bool Search(BstNode* root,int data) {
if(root == NULL) {
return false;
}
else if(root->data == data) {
return true;
}
else if(data <= root->data) {
return
Search(root->left,data);
}
else {
return
Search(root->right,data);
}
}
int main() {
BstNode* root = NULL; // Creating an empty
tree
/*Code to test the logic*/
root = Insert(root,15);
root = Insert(root,10);
root = Insert(root,20);
root = Insert(root,25);
root = Insert(root,8);
root = Insert(root,12);
// Ask user to enter a number.
int number = 25;
//If number is found, print "FOUND"
if(Search(root,number) == true)
cout<<"Found\n";
else cout<<"Not Found\n";
}