diff --git a/operations_on_datastructures/reverse_binary_tree.cpp b/operations_on_datastructures/reverse_binary_tree.cpp
index 658ac51ec..ce9dd8a72 100644
--- a/operations_on_datastructures/reverse_binary_tree.cpp
+++ b/operations_on_datastructures/reverse_binary_tree.cpp
@@ -1,7 +1,7 @@
 /**
  * @file
  * @brief Implementation for the [Reversing a Binary
- * Tree](https://www.geeksforgeeks.org/reverse-tree-path/) recursively.
+ * Tree](https://www.geeksforgeeks.org/reverse-tree-path/) recursively algorithm.
  * @details A binary tree can be reversed by swapping the left and
  * right child of a node at each node, starting from the root, and
  * cascading below. This solution aims to provide an implementation of