Update operations_on_datastructures/inorder_successor_of_bst.cpp

foo290 · Panquesito7 · web-flow · commit 420a4ec193a6 · 2021-07-14T09:23:16.000+05:30
Co-authored-by: David Leal &lt;halfpacho@gmail.com&gt;
diff --git a/operations_on_datastructures/inorder_successor_of_bst.cpp b/operations_on_datastructures/inorder_successor_of_bst.cpp
@@ -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

Original file line number	Diff line number	Diff line change
`@@ -7,7 +7,7 @@`
`7`	`7`	`* @details`
`8`	`8`	`* ### Case 1: The given node has the right node/subtree`
`9`	`9`	`*`
`10`		`- * In this case the left most deepest node in the right subtree will come`
	`10`	`+ * * In this case, the left-most deepest node in the right subtree will come`
`11`	`11`	`* just after the given node as we go to left deep in inorder.`
`12`	`12`	`* - Go deep to left most node in right subtree.`
`13`	`13`	`* OR, we can also say in case if BST, find the minimum of the subtree`