Delete a node from Binary Search Tree | BST

In this video, I have discussed how we can delete a node from a Binary Search Tree. Removing a node from a BST can have three possiblilities:
- Node to be deleted is a leaf node i.e has 0 child
- Node to be deleted has 1 child
- Node to be deleted has 2 child
I have explained the deletion on all the above type of nodes and shared implementation as well.

Source code: https://github.com/fit-coder/fitcoder...

00:00 Introduction
00:05 Types of node deletion
01:16 Search the node to be deleted
02:44 Case I: Leaf node
03:25 Case II: Node has 1 child
04:49 Case III: Node has 2 child
06:50 Implementation

-------------------------------------------------------------
I live in New Delhi and love explaining programming concepts. I have done M.Tech(BITS Pilani) + B.Tech(PEC, Chandigarh) in Computer Science and am currently working as a software engineer in a MNC.
If you like my content, please like, share my videos and subscribe to the channel.
-------------------------------------------------------------

For other BST tutorials, please refer to the below links:
Introduction to BST:    • Introduction to Binary Search Trees |...  

For other tree tutorials, please refer to the below playlist:
   • Tree Data Structures  

For in-depth Graph theory and implementation details, please refer to the below playlist:
   • Graph Algorithms  

#DataStructure,#Trees,#FitCoder,#Algorithm,#competitiveprogramming,#binarytree