Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /**
- * 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) {
- 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;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement