OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

clang-format and clang-tidy fixes for fb86292d

Browse Source
This commit is contained in:
github-actions 2021-10-19 01:03:23 +00:00
parent 6c5794a3d6
commit e9cd4fd10b
1 changed files with 11 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
operations_on_datastructures/reverse_binary_tree.cpp
View File

@ -31,10 +31,10 @@ struct Node {
/** /**
* @brief Creates a new Node with some initial data * @brief Creates a new Node with some initial data
*/ */
Node(int _data) { explicit Node(int _data) {
data = _data; ///< Set value of Node data data = _data; ///< Set value of Node data
left = NULL; ///< Initialize left child to NULL left = nullptr; ///< Initialize left child to NULL
right = NULL; ///< Initialize right child to NULL right = nullptr; ///< Initialize right child to NULL
} }
}; };
@ -56,7 +56,7 @@ class BinaryTree {
* @returns Node pointer to the root * @returns Node pointer to the root
*/ */
Node* insert(int data, Node* pivot) { Node* insert(int data, Node* pivot) {
if (pivot == NULL) { if (pivot == nullptr) {
return new Node(data); ///< Create new node return new Node(data); ///< Create new node
} }
if (data <= pivot->data) { if (data <= pivot->data) {
@ -75,7 +75,7 @@ class BinaryTree {
* @returns Node pointer to root node * @returns Node pointer to root node
*/ */
Node* reverseBinaryTree(Node* pivot) { Node* reverseBinaryTree(Node* pivot) {
if (pivot == NULL) { if (pivot == nullptr) {
return pivot; ///< Base case return pivot; ///< Base case
} }
Node* temp = pivot->left; ///< pointer to the left subtree Node* temp = pivot->left; ///< pointer to the left subtree
@ -88,11 +88,11 @@ class BinaryTree {
/** /**
* @brief Creates a BinaryTree with a root pointing to NULL. * @brief Creates a BinaryTree with a root pointing to NULL.
*/ */
BinaryTree() { root = NULL; } BinaryTree() { root = nullptr; }
/** /**
* @brief Creates a BinaryTree with a root with an initial value. * @brief Creates a BinaryTree with a root with an initial value.
*/ */
BinaryTree(int data) { root = new Node(data); } explicit BinaryTree(int data) { root = new Node(data); }
/** /**
* @brief Adds a new Node to the Binary Tree * @brief Adds a new Node to the Binary Tree
*/ */
@ -113,7 +113,7 @@ class BinaryTree {
*/ */
std::vector<int> get_level_order() { std::vector<int> get_level_order() {
std::vector<int> data; ///< Result vector of int std::vector<int> data; ///< Result vector of int
if (root == NULL) { if (root == nullptr) {
return data; ///< Return empty vector if root is Invalid return data; ///< Return empty vector if root is Invalid
} }
std::queue<Node*> nodes; ///< Queue of the nodes in the tree std::queue<Node*> nodes; ///< Queue of the nodes in the tree
@ -122,10 +122,10 @@ class BinaryTree {
Node* temp = nodes.back(); ///< Copy the first element Node* temp = nodes.back(); ///< Copy the first element
data.push_back(temp->data); ///< Add the element to the data data.push_back(temp->data); ///< Add the element to the data
nodes.pop(); ///< Remove element nodes.pop(); ///< Remove element
if (temp->left != NULL) { if (temp->left != nullptr) {
nodes.push(temp->left); ///< Insert left node nodes.push(temp->left); ///< Insert left node
} }
if (temp->right != NULL) { if (temp->right != nullptr) {
nodes.push(temp->right); ///< Insert right node nodes.push(temp->right); ///< Insert right node
} }
} /// Add nodes while Tree is not empty } /// Add nodes while Tree is not empty