public void insert(Node newNode){
		
		if(root==null){
			root=newNode;
			root.key=root.hashcode(500);	//set root key as 500 by call method
		}
		else {						// if not root
			Node curnt=root;
			Node parnt;
			while (true) {			//travese trough the tree to find correct place and joint to tree
				parnt=curnt;
				if(newNode.getKey()<curnt.getKey()){
					curnt=curnt.leftChld;
					if(curnt== null){
						parnt.leftChld=newNode;					
						return;
					}
					
				}else{
					curnt=curnt.rightChld;
					if(curnt== null){
						parnt.rightChld=newNode;

						return;
					}
				}
			}			
			
		}

	}