Updated documentation wording

This commit is contained in:
Alvin Philips 2021-10-19 15:30:51 +05:30
parent 14a26c3f2e
commit 39bb9b9a0d

View File

@ -1,12 +1,8 @@
/** /**
* @file * @file
<<<<<<< Updated upstream
* @brief Implementation for the [Reversing a Binary * @brief Implementation for the [Reversing a Binary
* Tree](https://www.geeksforgeeks.org/reverse-tree-path/) recursively algorithm. * 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
* @details A binary tree can be reversed by swapping the left and * @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 * right child of a node at each node, starting from the root, and
* cascading below. This solution aims to provide an implementation of * cascading below. This solution aims to provide an implementation of
@ -27,7 +23,8 @@ namespace operations_on_datastructures {
/** /**
* @namespace reverse_binary_tree * @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 { namespace reverse_binary_tree {