lintcode-easy-Insert Node in a Binary Search Tree

/**
 * Definition of TreeNode:
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left, right;
 *     public TreeNode(int val) {
 *         this.val = val;
 *         this.left = this.right = null;
 *     }
 * }
 */
public class Solution {
    /**
     * @param root: The root of the binary search tree.
     * @param node: insert this node into the binary search tree
     * @return: The root of the new binary search tree.
     */
    public TreeNode insertNode(TreeNode root, TreeNode node) {
        // write your code here
        if(root == null)
            return node;
        
        if(root.val == node.val){
            return root;
        }
        
        if(root.left == null && root.val > node.val){
            root.left = node;
            return root;
        }
        
        if(root.right == null && root.val < node.val){
            root.right = node;
            return root;
        }
        
        if(root.val > node.val){
            TreeNode left = insertNode(root.left, node);
            root.left = left;
        }
        else if(root.val < node.val){
            TreeNode right = insertNode(root.right, node);
            root.right = right;
        }
        
        return root;
    }
}

/**
 * Definition of TreeNode:
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left, right;
 *     public TreeNode(int val) {
 *         this.val = val;
 *         this.left = this.right = null;
 *     }
 * }
 */
public class Solution {
    /**
     * @param root: The root of the binary search tree.
     * @param node: insert this node into the binary search tree
     * @return: The root of the new binary search tree.
     */
    public TreeNode insertNode(TreeNode root, TreeNode node) {
        // write your code here
        if(root == null)
            return node;
        
        if(root.val == node.val)
            return root;
        
        TreeNode p = root;
        
        while(!(p.left == null && p.val > node.val) && !(p.right == null && p.val < node.val)){
            if(p.val > node.val)
                p = p.left;
            else if(p.val == node.val)
                return root;
            else
                p = p.right;
        }
        if(p.left == null && p.val > node.val){
            p.left = node;
            return root;
        }
        else{
            p.right = node;
            return root;
        }
    }
}