Can you review my simple Binary Search Tree?

[SValPlusPlus]

Hello! My name is Stuart and I'm a moderate programmer who is currently trying to get his coding knowledge up to scratch. I'm also quite new to C++ hence this topic in this forum.

I've made a simple working BST which is one of my first attempts at a data structure and also the most complete thing I have written in C++ so far. I'm looking for any feedback you can give me regarding technique, code readability, anything really. Although if you could tell me whether keeping the recursive member functions that deal with pointers private is needed or not that would be great.

I want to build on this and add self-balancing so be as harsh as you like. I am here to learn. Thanks!

#include "../../std_lib_facilities.h"


class Node {
public:
	Node(const int& n, Node* l = 0, Node* r = 0)
		: key(n), left(l), right(r) {}

	int getKey() const { return key; }
	Node* getLChild() const {return left; }
	Node* getRChild() const { return right; }
	void setLChild(Node* np) {left = np;}
	void setRChild(Node* np) {right = np;}

private:
	int key;

	Node* left;
	Node* right;
};


class BST {
public:
	BST()
		:root(0){}

	void add(int);
	void outputTree();

private:
	void recAdd(Node*,int);   // Private recursive member functions to keep pointer manipulation away from user
	void recOutputTree(Node*);

	Node* root;
};


void BST::add(int n)
{
	if(root==0) root = new Node(n);
	else recAdd(root,n);
	
}

void BST::recAdd(Node* tempRoot, int n)
{
	if(n < tempRoot->getKey() ) {
		if( !tempRoot->getLChild() ) { tempRoot->setLChild(new Node(n)); }
		else { recAdd(tempRoot->getLChild(),n); }
	}
	else if(n > tempRoot->getKey() ) {
		if( !tempRoot->getRChild() ) { tempRoot->setRChild(new Node(n)); }
		else { recAdd(tempRoot->getRChild(),n); }
	}
}

void BST::outputTree()
{
	if (!root) cout << "NULL TREE" << endl;
	else recOutputTree(root);
}

void BST::recOutputTree(Node* tempRoot)
{
	if(tempRoot->getLChild() ) recOutputTree( tempRoot->getLChild() );
	cout << "Key: " << tempRoot->getKey() << endl;
	if(tempRoot->getRChild() ) recOutputTree( tempRoot->getRChild() );
}

int _tmain(int argc, _TCHAR* argv[])
{

	BST bst;

	for (int i=0; i < 200; i++)  // adds numbers backwards see we can see if the tree is sorting
		bst.add(200-i);


	bst.outputTree();

	keep_window_open();
	return 0;
}