Paras Babbar paras062
paras062
/ BSTDeletion_CPP.cpp
Last active
January 29, 2020 05:31
— forked from mycodeschool/BSTDeletion_CPP.cpp
Added case to delete the root node of the BST, Modified function FindMin to handle deletion from both right and left subtree. Added flag variable to judge if root node has to be deleted
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /* Deleting a node from Binary search tree */ | |
| #include<iostream> | |
| using namespace std; | |
| struct Node { | |
| int data; | |
| struct Node *left; | |
| struct Node *right; | |
| }; | |
| //Function to find minimum in a tree. | |
| // Changes by Paras Starts |