#include <iostream>
using namespace std;
class BinTree{
private:
class BinNode{
public:
int idata;
BinNode *left,*right;
BinNode(int a = 0) {idata = a; left = right = 0; }
};
BinNode *root;
BinNode *addNode(BinNode *rp, BinNode *node);
BinNode *delNode(BinNode *rp,int x);
public:
BinTree(){ root = 0;}
void insert(int x){
BinNode *np = new BinNode(x);
if(!root) root = np;
else root = addNode(root, np);
}
void remove(int x){ root = delNode(root,x); }
};
BinTree::BinNode *BinTree::addNode(BinNode *rp,BinNode *node){
if (rp == 0) {
return node;
}
if(rp->idata > node->idata) {
rp->left = addNode(rp->left, node);
return rp;
} else {
rp->right = addNode(rp->right, node);
return rp;
}
}
BinTree::BinNode *BinTree::delNode(BinNode *rp, int x){
return 0; /* Q が書いてる */
}