backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-02-03 18:46:50 +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-14 09:23:16 +05:30
committed by GitHub
parent 80772024d3
commit 420a4ec193
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
operations_on_datastructures/inorder_successor_of_bst.cpp
View File

@@ -7,7 +7,7 @@
* @details
* ### Case 1: The given node has the right node/subtree
*
* In this case the left most deepest node in the right subtree will come
* * In this case, the left-most deepest node in the right subtree will come
* just after the given node as we go to left deep in inorder.
* - Go deep to left most node in right subtree.
* OR, we can also say in case if BST, find the minimum of the subtree