class BST{
	Node *root;
	void traverse( Node *r )
	{
		if (r != NULL)
		{
			traverse(r->left);
			cout << r->data << endl;
			traverse(r->right);
		}
		
	}

public:
	BST(){
		root = NULL;
	}

	//Insert data into the node
	void insert(int data)
	{
		Node *temp = new Node(data);
		Node *t = root;
		if (root == NULL)
		{
			root = temp;
		}
		else if (data < root->data){
			while (t->left != nullptr){
				t = t->left;
			}
			t->left = temp;
		}

		else{
			while (t->right != nullptr){
				t = t->right;
			}
			t->right = temp;
		}
	}

	bool search(int data)
	{
		Node *t = root;
		bool find = false;
		if (root->data == data){
			find = true;
		}

		else if (data < root->data)
		{
			while (t->left != nullptr)
			{
				t = t->left;
				if (t->data == data){
					find = true;
					break;
				}
			}
			
		}

		else{
			while (t->right != nullptr)
			{
				t = t->right;
				if (t->data == data){
					find = true;
					break;
				}
			}
			
		}
		delete t;
		return find;
		
	}

	//Function to show elements
	void Display()
	{
		Node* t = root;
		traverse(t);

	}
};