From 026d337999e3b50b584f5dd3c8848e0e005cbd26 Mon Sep 17 00:00:00 2001 From: Nitin Sharma <32377892+foo290@users.noreply.github.com> Date: Mon, 12 Jul 2021 13:44:25 +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 | 4 +--- 1 file changed, 1 insertion(+), 3 deletions(-) diff --git a/operations_on_datastructures/inorder_successor_of_bst.cpp b/operations_on_datastructures/inorder_successor_of_bst.cpp index 2a0362482..1506ebf46 100644 --- a/operations_on_datastructures/inorder_successor_of_bst.cpp +++ b/operations_on_datastructures/inorder_successor_of_bst.cpp @@ -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.