public void addNodeSorted(treeNode newNode, treeNode curRoot) {
		if (newNode.value < curRoot.value) {// add to left child tree
			if (curRoot.leftLeaf != null) {
				addNodeSorted(newNode, curRoot.leftLeaf);
			} else {
				curRoot.leftLeaf = newNode;
				newNode.parent = curRoot;
			}
		}

		if (newNode.value > curRoot.value) { // add to right child tree
			if (curRoot.rightLeaf != null) {
				addNodeSorted(newNode, curRoot.rightLeaf);
			} else {
				curRoot.rightLeaf = newNode;
				newNode.parent = curRoot;
			}
		}
	}