Insert a new node into a binary search tree with a given key value. Traverse the tree to find the appropriate location to insert the new node based on whether its key is less than or greater than existing nodes. Update pointers once the new node is inserted in the correct position.