Leetcode/leetcode450.cpp at main · ksaini-web/Leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
/**
 * 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* findMin(TreeNode* root){
        while(root->left!=NULL){

            root = root->left;
        }

        return root;
    }

    TreeNode* deleteNode(TreeNode* root, int key) {

        if(root == NULL ) return NULL;

         if(root->val>key){
            root->left = deleteNode(root->left , key);
         }

         else if(root->val < key){
            root->right = deleteNode(root->right , key);
         }

         else{

            if(root->left == NULL) return root->right;

            if(root->right == NULL) return root->left;


            TreeNode* temp = findMin(root->right);

            root->val = temp->val;


            root->right = deleteNode(root->right , temp->val);


         }
         return root;

    }
};