@@ -0,0 +1,443 @@
+package lintcode.bst;%0A%0Aimport fundamentals.tree.TreeNode;%0A%0A/**%0A */%0Apublic class MyBst %7B%0A%0A    // 85-Insert Node in a Binary Search Tree%0A    public TreeNode insertNode(TreeNode root, TreeNode node) %7B%0A        if (root == null) return node;%0A        if (node.val %3C root.val) %7B%0A            root.left = insertNode(root.left, node);%0A        %7D else %7B%0A            root.right = insertNode(root.right, node);%0A        %7D%0A        return root;%0A    %7D%0A%0A    %0A%0A%7D%0A

Implement my binary search tree