From 872bc4c7bc2b4b397575428576077e19a1456cbe Mon Sep 17 00:00:00 2001 From: Nitin Sharma <32377892+foo290@users.noreply.github.com> Date: Mon, 12 Jul 2021 13:44:40 +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 1506ebf46..6f3162862 100644 --- a/operations_on_datastructures/inorder_successor_of_bst.cpp +++ b/operations_on_datastructures/inorder_successor_of_bst.cpp @@ -13,9 +13,7 @@ * OR, we can also say in case if BST, find the minimum of the subtree * for a given node. * - * ### Case 2 - * - * The given node does not have a right node/subtree + * ### Case 2: The given node does not have a right node/subtree * * #### Method 1: Use parent pointer (store the address of parent nodes) * If a node does not have right subtree, and we already visited the node