Binary search Tree

Java

public class BSTNode {

private int value;

private BSTNode left;

private BSTNode right;

public BSTNode(int value) {

this.value = value;

left = null;

right = null;

}

}

public class BinarySearchTree {

private BSTNode root;

public BinarySearchTree() {

root = null;

}

}

C++

class BSTNode {

private:

int value;

BSTNode* left;

BSTNode* right;

public:

BSTNode(int value) {

this->value = value;

left = NULL;

right = NULL;

}

};

class BinarySearchTree {

private:

BSTNode* root;

public:

BinarySearchTree() {

root = NULL;

}

};