backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-05-08 23:23:05 +08:00
Code Issues Projects Releases Wiki Activity

Update operations_on_datastructures/inorder_successor_of_bst.cpp

Browse Source 
Co-authored-by: David Leal <halfpacho@gmail.com>
This commit is contained in:
Nitin Sharma
2021-07-12 13:44:40 +05:30
committed by GitHub
parent 026d337999
commit 872bc4c7bc
1 changed files with 1 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
operations_on_datastructures/inorder_successor_of_bst.cpp
View File

@@ -13,9 +13,7 @@
* OR, we can also say in case if BST, find the minimum of the subtree
* for a given node.
*
* ### Case 2
*
* The given node does not have a right node/subtree
* ### Case 2: The given node does not have a right node/subtree
*
* #### Method 1: Use parent pointer (store the address of parent nodes)
* If a node does not have right subtree, and we already visited the node