struct TreeNode {
	int val;
	TreeNode *left;
	TreeNode *right;
	TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};


void insertNode(TreeNode *current, int val){
	if(current == NULL)    {
		current = new TreeNode(val);
		return;
	}

	if(current->val > val){
		if(current->left == NULL){
			current->left = new TreeNode(val);
		}else{
			insertNode(current->left, val);
		}
	}else{
		if(current->right == NULL){
			current->right = new TreeNode(val);
		}else{
			insertNode(current->right, val);
		}
	}
}