#ifndef ___BINARY__TREE__
#define ___BINARY__TREE__

#include <iostream>
#include <cassert>

template <typename T>
class btree
{
private:
	T data;
	bool empty;
	btree<T>* left, * right;

public:
	btree() { empty = true; left = right = NULL; }
	btree(T& elem) 
	{ 
		data = elem; 
		empty = false; 
		left = right = NULL; 
	}

	btree(const btree<T>& tree2);		// copy constructor
	~btree();

	void swap(btree<T>& tree2);

	void binsert(T& elem);

	bool find(T& elem);

	void inorder(std::ostream& out);
	void preorder(std::ostream& out);
	void postorder(std::ostream& out);

};

void swap(btree<T>& tree2);


#endif