Delete a Node in BST | Deletion in BST | Delete a Node in Binary Search Tree | DSA-One Course #68

[@startupmindset7597]

my all friends learn things from different coaching classes in hydrabad ,Mumbai or pune ....but they have not much knowledge in programming , but i learn from anuj bhaiya DSA one course which is free and i have so much knowledge , compare to my friends , they always call me to ask the doubts, ... thank you ANUJ BHAIYA for this great course .....free for us.....

[@girlysh09]

then suggest them this playlist dude

[@digvijay17july]

Finally, one of the awaited videos For BST Lovers 🤣

[@highonpeeks]

was stuck on this from long time but after watching this video, the concept is crystal clear

[@trishnapatil4594]

What a wonderful explanation to an otherwise complex problem! Loved it! Thanks a lot!

[@SaiKiranPatro]

No one can better explain than Anuj Bhaiya ❤

[@shinratenten5686]

experienced it many times, you make every concept easier

[@PicachuPicachu-e5k]

sir jo program ko aap smjhate ho usko bhi description me dal de to or bhi benefitial ho...smjhne mei

[@raunakrhishabh2773]

The way u explain & made things visualize, its awsm!!! Thnx bro

[@kartikeyrawat5456]

Very nice explanation !!! God bless you.

[@MUHAMMADALISHAFIQUE-w2d]

many times better than apna college not spreading hate but its fact 100%

[@PicachuPicachu-e5k]

sir program ko pura show kiya kre #include se end tk...plz...otherwise samjhne me dikkt aati h

[@stith_pragya]

Thank You So Much for this wonderful video........🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻

[@tushargogiya4017]

Nice Explanation bhaiya hats off to you

[@saritaprasad4295]

tough topic explanation in easy way

[@pallavigavali2671]

Thank you bhaiya 👍

[@lokendrasingh9780]

Bhaiya whiteboard is best 👍❤️ thank you bhaiya ❤️❤️

[@parasdua4242]

So, smooooooth Amazing ✨

[@zakyvids6566]

Hi Anuj Bhaiya I like your content a lot But I had a request please make oops in python as well as how to use pyautogui and selenium Thanks a lot Love from Australia ❤️❤️❤️❤️❤️👍👍👍👍👍

[@meenakshidwivedi83]

Truely Awesome..Thanks

[@abhinavsinha8116]

Sir, I need your java placement cousre playlist which got deleted. There very important lectures in that playlist. Please do somethng.

[@nikgshort3974]

Yes sir

[@pt_harshit]

Nice...

[@rahulsinghshekhawat2487]

great explanation !!!

[@girishmahajan4130]

Thank you so much bhaiya

[@dhanrajlouvanshi7872]

Thanks

[@pratimdutta1979]

thank you sir

[@jatindigra4329]

awesome !! loved the explanation !!

[@AK-ft7fd]

This solution in leetcode shows RUNTIME ERROR. Please help!

[@sankalpgupta5505]

bhaiya are you going to cover graphs and DP as well???

[@anujkumarsharma1013]

Yes, these topics will come after.

[@babunmadhab]

@@anujkumarsharma1013 bhaiya code thoda link description m de dijiye na

[@creativevision9204]

Please share iterative approach as well.

[@pranavnyavanandi9710]

I will try implementing one on my own.

[@gtbaba123]

Bro I love u

[@musqitonebeats2129]

time complexity?

[@coftanurag]

I think you miss leaf node deletion case

[@anshulsingh1265]

Done

[@deepakantoj432]

the question is to delete a node from BST my approach is that i'll first get the key node and then also get the parent node of the key node . connect the parent node's left or right to key node's right . and store the key node's left in a temp node i'll traverse to the very left of the newly connected parent's left and attach the temp . /** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode() {} * TreeNode(int val) { this.val = val; } * TreeNode(int val, TreeNode left, TreeNode right) { * this.val = val; * this.left = left; * this.right = right; * } * } */ class Solution { public TreeNode deleteNode(TreeNode root, int key) { TreeNode node = solve(root,key); // key node TreeNode n = helper(root,key); // parent node if(n.left != null) if( n.left.val == key) n.left = node.right; else if(n.right != null) if(n.right.val == key) n.right = node.right; TreeNode left = node.left; TreeNode cur = node.right; while(cur.left!=null) { cur = cur.left; } cur.left = left; return root; } public TreeNode helper(TreeNode root , int val) { if(root == null) return null; if(root.left!=null) { if(val == root.left.val) return root; } else if(root.right!=null){ if(val == root.right.val) return root; } return val > root.val ? helper(root.right , val) : helper(root.left , val); } public TreeNode solve(TreeNode root , int val) { if(root == null) return null; if(val == root.val) return root; return val > root.val ? solve(root.right , val) : solve(root.left , val); } } where have i gone wrong anybody please help

[@sankalpgupta5505]

bhaiya please make a roadmap on international placements🙏❤️

[@souhardyahalder3903]

Na bhai national karlo pehle... international se kya hoga

[@tushargogiya4017]

@@souhardyahalder3903 ilets krlega😂😂😂😂

[@codingiseasy8]

Nic sir

[@premprakashsahu7923]

Bhaiya thodi jldi jldi videos bnaya kro ,reach ni bdh ri

[@MACR_RaviKumar]

❤❤

[@NishantKumar-bu7wh]

Can anyone please explain that if the root of updated subtree is already attached to the root of the BST, why is it explicitly compulsory to attach again to the root of the BST?

[@Coding_Destini]

Bhaiiyya but where we are checking when key (data to be delete) == root.data ????

[@abhisheknag1929]

that is else part only

[@rudrakshdatta4389]

Share the code of delete and insert node in a Binary Search Tree

[@chandraveersingh5561]

Hi Bhaiya! Mera comment pin krdo Mai dosto ko dikhao ga

[@yashrajpathak8103]

fir tu isse apne resume me bhi laga lio bhai

[@codingwithsukesh]

💖💖👍👍

[@DianaAnahíLedesmaRoque]

He talks very quickly 😅

[@pandeyshashidhar]

In leetcode code is showing TLE class Solution { public TreeNode deleteNode(TreeNode root, int key) { if(root == null) return null; if(key < root.val) root.left = deleteNode(root.left,key); else if(key>root.val) root.right = deleteNode(root.right,key); else{ if(root.left == null) return root.right; else if(root.right == null) return root.left; root.val = maxElement(root.right); root.right = deleteNode(root.right,root.val); } return root; } public int maxElement(TreeNode root){ while(root.left != null){ root.val = root.left.val; } return root.val; } }

[@praminthakur8166]

In the maxElement() method , you are not setting a condition for the while loop to end. Thus, it will give TLE. It should be : public int minElement(TreeNode root){ int minv = root.val; while(root != null){ if(root.val < minv) minv = root.val; root = root.left; } return minv; }

[@NayeemKhan-gg2nc]

in your maxElement function inside while loop you have to add root = root.left;

[@PatitapabanBisoi]

Thanks