Your implementation has several flaws. 1) You don't need two classes Tree and Node, you can merge them into one. 2) methods like AddNode(), RemoveNode() and Search() have to be public 3) the contructor of a Node/Tree should ideally have a value parameter, like Tree(int value) 4) you don't need a root node in your tree, left and right childs are enough 5) when adding/searching/removing check for < and >= and not just > and < Once you fix that, you may use it like that:
Tree binTree = new Tree(5);
binTree.Add(10);
binTree.Add(3);
There are lots of bintree examples on the internet, you can almost copy them 1 to 1, even the Java ones ;) regards