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:25 +05:30
committed by GitHub
parent eac40112cc
commit 026d337999
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

@@ -5,9 +5,7 @@
* successor of a node is the next node in Inorder traversal of the Binary Tree.
* Inorder Successor is NULL for the last node in Inorder traversal.
*
* ### Case 1
*
* The given node has right node/subtree
* ### Case 1: The given node has the right node/subtree
*
* 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.