#pragma once
#include<iostream>
using namespace std;

class binarySearchTree
{
private:
	class node
	{
	public:
		double data;
		node* left;
		node* right;

		node(double x)
		{
			data = x;
			left = nullptr;
			right = nullptr;
		}
	};

	node* root;

	//insert x into tree rooted at
	//node p.
	void recInsert(node*& p, double x)
	{
		if (p==nullptr) //base case
		{
			p=new node(x);
		}
		else //recursive case
		{
			if (x < p->data)
				recInsert(p->left, x);
			else
				recInsert(p->right, x);
		}
	}

	//print all items in tree rooted at node p
	//An in-order traversal to display the items.
	void recDisplay(node * p)
	{
		if(p==nullptr) //base case
		{
			//don't do anything
		}
		else
		{
			recDisplay(p->left);
			cout << p->data << endl;
			recDisplay(p->right);
		}
	}

	//return number of items in tree
	//rooted at p.
	int numItems(node* p)
	{
		if (p == nullptr) //base case
			return 0;
		else //recurisive case
		{
			int numLeft = numItems(p->left);
			int numRight = numItems(p->right);
			return 1 + numLeft + numRight;
		}
	}

public:
	binarySearchTree()
	{
		root = nullptr;
	}

	void insert(double x)
	{
		recInsert(root,x);
	}

	int numItems()
	{
		return numItems(root);
	}

	void print()
	{
		recDisplay(root);
	}
};