C Code For Deletion in a Binary Search Tree

code provide kr do

where is the source code and notes for this video SIR ?

Theme is worst 😢

code link????

this code fails corner case when there is only one node in bst

I have a question if we give a value that is not in the bst then this code will just go and delete the leaf node we are not checking if the value is there or not we are assuming it is.

Are bhai , yeh code download kaha se karna hain????

Notes kha pe hae?

Not discussed the case where left child is null


struct node* inorderpred(struct node* root){
root=root->left;

while(root->right!=NULL){
root=root->right; // rightmost not null node of left subtree of the value to be deleted will be the inorder predecessor of the value
}
return root;
}

struct node* inordersucc(struct node* root){
root=root->right;

while(root->right!=NULL){
root=root->left; // leftmost not null node of right subtree of the value to be deleted will be the inorder successor of the value
}
return root;
}

struct node* deleteNode(struct node* root,int value){
struct node* ipre;
struct node* insuc;
// printf("%d ",root->data);
if(root==NULL) {return NULL;}
if(root->left==NULL && root->right==NULL && root->data==value){ // inorder predecessor of the value will always be a leaf node
free(root);
return NULL;
}
// searching for the node value
if(value<root->data) {root->left=deleteNode(root->left,value);}
else if(value>root->data) {root->right=deleteNode(root->right,value);}
else{
// when the value is found
if(root->left==NULL){
insuc=inordersucc(root);
root->data=insuc->data;
root->right=deleteNode(root->right,insuc->data);
}
else{
printf("%d ",root->data);
ipre=inorderpred(root); // finding the inorder predecessor
root->data= ipre->data;
root->left=deleteNode(root->left,ipre->data); // deletion of the predecessor data

}
}
return root;
}


for example

5
/ \
3 6
/ \ \
1 4 7

i thought 3 case k liye 3 alag alag code honge

the case when a middle node is to be deleted and its left pointer is null and right point to another node .This case is not taken in consideration

For anyone who needs code :
Code For Deletion as Explained by Harry Bhai ----->

Code :

Node* inOrderPredecessor(struct Node* root){
root = root->left;
while(root->right!=NULL){
root = root->right;
}
return root;
}

struct Node * deleteNode(struct Node* root, int value){
Node* iPre;
if(root==NULL){
return NULL;
}
if(root->left == NULL && root->right==NULL && root->data == value){
free(root);
return NULL;
}

//search for the node to be deleted
if(value<root->data){
root->left = deleteNode(root->left, value);
}else if (value>root->data){
root->right = deleteNode(root->right, value);
}

//Deletion strategy when tree is found
else{
iPre = inOrderPredecessor(root);
root->data = iPre->data;
root->left=deleteNode(root->left, iPre->data);
}
return root;
}

we can write 2nd if statement in the deletenode function as " if(head->left == NULL && head->right == NULL && head->data == dat)" where it checks the value matches with target node or not otherwise it can delete a node which is just a leaf node having left and right pointers NULL on providing the value which is not in the tree

source code nahi dia hai apne bhai...aur jo code apke website mein dikha raha hai wo galat hai as per your video wala code !!!😑

bhaiya code khaa hai

if the node to be deleted is found in the "if" conditions then how does it enter the else condition to perform the deletion strategy? please help its confusing me for days now @CodeWithHarry

Hope you get 5M subscribers asap❤❤

I have a doubt. Let's assume there's a single node with its left and right both pointed to null and data set to 10. And then if the deleteNode function gets called with value 8 (or any value), then won't the second IF statement inside the deleteNode function delete that single node in the tree even if the value for which deleteNode was called doesn't match with the existing single node we have??

I'm facing an issue while solving this I have created one .cpp in which I have written all operations in BST (create a new node, in order, pre, post, and all) and in the same file now when I write this code it is not giving me output but when I run it separately in other .cpp file it runs smoothly. not getting what the issue is if you got it please explain me.

Font ligatures nahi ho raha🥲

sir if we try to delete those node which is not in the Bst then it is not working what is the best solution

The tutorial is good i guess the changes are not implemented on website's code.

This code seems to have 'Address Mismatch Error' as its trying to free the memory which is previously never allocated. Its working for the cases with taking this problem too.

Amazing bro👌👌👌👌

Where is the code

There is some addition in the code to handle cases when the node is not present OR when the left child of root is not present. When left child is not present, we use the in-order successor to fill the created void. Here is the code:

Node* inOrderPredecessor(Node* root){
root = root->left;
while (root->right!=NULL)
{
root = root->right;
}
return root;
}

//Inorder successor is the leftmost element of the right subtree

Node* inOrderSuccessor(Node* root){
root = root->right;
while (root->left!=NULL)
{
root = root->left;
}
return root;
}

Node* deleteNode(Node* root, int value){
Node* i_pre_post;
if (root == NULL){
return NULL;
}
if (root->left==NULL && root->right==NULL && root->data == value){ //Additional check before deleting the leaf Node
free(root);
return NULL;
}

//searching for the node to be deleted
if (value < root->data){
root->left = deleteNode(root->left,value);
}
else if (value > root->data){
root->right =deleteNode(root->right,value);
}
//deletion strategy when the node is found
else{
if(root->left == NULL && root->right != NULL){ //Using inorder Successor when left child is not present
i_pre_post = inOrderSuccessor(root);
root->data = i_pre_post->data;
root->right = deleteNode(root->right, i_pre_post->data);

}
else{
i_pre_post = inOrderPredecessor(root);
root->data = i_pre_post->data;
root->left = deleteNode(root->left, i_pre_post->data);
}
}
return root;
}

//Like if this helped (^_^). Comments are welcome ->

great help. thanks harry bhai!. small correction -------- code for inorder precessor is not correct. what if root->left itself is null

I was confused in this one before watching this video. Thanks for clearing it up

Ab tak ka sabse tough code yhi tha. 😓😓😤😤😤😞😤😭😭😭😦 shi yad ho payega 😤

Bhai iss video ki starting ke kuch AAPKE sabd bahut hi adbhut aur rahasmayi the

where is code link

where is the source code link

thanks_Sir❤️🙏

Showing Gratitude by Commenting.

shows error for deleting 98 in
87
/ \
44 98
/ \ \
12 49 100

WHy i am not getting the output when i am going to delete 5...it is not deleting 5

this code is slightly wrong.....for example it will not work for a right skewed BST.......

Please make videos on dp and greedy algorithms 🙏🙏

Harry bhai aapka bhi ye video samjh nhi aaya , concept clear nahi hua

Bhai, iska pura source code share kijiye pls