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

clang-format and clang-tidy fixes for 420a4ec1

Browse Source
This commit is contained in:
github-actions
2021-07-14 03:53:59 +00:00
parent 420a4ec193
commit b1b82086b5
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
operations_on_datastructures/inorder_successor_of_bst.cpp
View File

@@ -7,8 +7,8 @@
* @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
* just after the given node as we go to left deep in inorder.
* * 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
* for a given node.