From 420a4ec193a686805bf969c3e01f819ebe14af90 Mon Sep 17 00:00:00 2001 From: Nitin Sharma <32377892+foo290@users.noreply.github.com> Date: Wed, 14 Jul 2021 09:23:16 +0530 Subject: [PATCH] Update operations_on_datastructures/inorder_successor_of_bst.cpp Co-authored-by: David Leal --- operations_on_datastructures/inorder_successor_of_bst.cpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/operations_on_datastructures/inorder_successor_of_bst.cpp b/operations_on_datastructures/inorder_successor_of_bst.cpp index 6c420dfa0..7c0fc3d7c 100644 --- 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