Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /**
- * Definition for a binary tree node.
- * struct TreeNode {
- * int val;
- * TreeNode *left;
- * TreeNode *right;
- * TreeNode() : val(0), left(nullptr), right(nullptr) {}
- * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
- * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
- * };
- */
- class Solution {
- public:
- TreeNode* insertIntoBST(TreeNode* root, int val) {
- if(!root) return new TreeNode(val);
- if(root->val < val){
- root->right = insertIntoBST(root->right, val);
- }
- else{
- root->left = insertIntoBST(root->left, val);
- }
- return root;
- }
- };
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement