Write a function to insert a Node in a binary search tree. A binary search tree is a binary tree in which value of all the nodes left of a node are lesser than it and value of all the nodes right of node are greater than it.

You need to write a function named "InsertNodeInBST" that will take root of a binary search tree as argument.

Your function must return pointer to root after insertion.