Given a binary search tree and a new tree node, insert the node into the tree. You should keep the tree still be a valid binary search tree.
Example
Given binary search tree as follow, after Insert node 6, the tree should be:
2 2 / \ / \ 1 4 --> 1 4 / / \ 3 3 6 Challenge
Can you do it without recursion?
Tags Expand
Related Problems Expand
//recursion
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){ root.left = insertNode(root.left, node); } else{ root.right = insertNode(root.right, node); } return root; } }