public class Binarno {
	private NodeBinarno root;
    boolean y;
	public boolean insert(int element) {
		NodeBinarno node=new NodeBinarno(element);
		if(root==null) {
			root=node;
			y=true; }
		else {
			NodeBinarno n = root ;
			NodeBinarno parent;
			if(n.compare(node)==0) {
               y=false;}
			else {
				while(n!=null&&n.compare(node)!=0) {
					parent=n;
				 if(n.compare(node)>0) {
					 n=n.leftchild;
					 if(n==null) {
						 parent.leftchild=node;
								 y=true;}
					 else {
						 y=false;} }
				 else {
					 n=n.rightchild;
							 if(n==null) {
								 parent.rightchild=node;
								 y=true;}
							else {
								 y=false; } }}}}
		System.out.println(y);
		return y;
	}