From 39bb9b9a0df9c8405139f4b62f3f9b224a56f9f2 Mon Sep 17 00:00:00 2001 From: Alvin Philips Date: Tue, 19 Oct 2021 15:30:51 +0530 Subject: [PATCH] Updated documentation wording --- operations_on_datastructures/reverse_binary_tree.cpp | 11 ++++------- 1 file changed, 4 insertions(+), 7 deletions(-) diff --git a/operations_on_datastructures/reverse_binary_tree.cpp b/operations_on_datastructures/reverse_binary_tree.cpp index 40cea104b..46b742efc 100644 --- a/operations_on_datastructures/reverse_binary_tree.cpp +++ b/operations_on_datastructures/reverse_binary_tree.cpp @@ -1,12 +1,8 @@ /** * @file -<<<<<<< Updated upstream * @brief Implementation for the [Reversing a Binary - * Tree](https://www.geeksforgeeks.org/reverse-tree-path/) recursively algorithm. -======= - * @brief Implemention for [Reversing a Binary - * Tree](https://www.geeksforgeeks.org/reverse-tree-path/) recursively. ->>>>>>> Stashed changes + * 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 @@ -27,7 +23,8 @@ namespace operations_on_datastructures { /** * @namespace reverse_binary_tree - * @brief Functions for the [Reverse a Binary Tree](https://www.geeksforgeeks.org/reverse-tree-path/) implementation + * @brief Functions for the [Reverse a Binary + * Tree](https://www.geeksforgeeks.org/reverse-tree-path/) implementation */ namespace reverse_binary_tree {