binary search tree

#import <iostream>
using namespace std;

public class MyNode {
    int data;
    MyNode left;
    MyNode right;
public:
    MyNode(int d) {data = d; }
    bool setLeft(MyNode);
    bool setRight(MyNode);
}

bool MyNode::setLeft(MyNode n) {
    left =  n;
    return true;
}

MyNode::setRight(MyNode n) {
    right = n;
    return true;
}

MyNode::addNode(int d) {
    if (d < data) {
        if (left) {
            left::addNode(d);
        } else {

    }
}