2.2) Find Maximum value among all nodes in the tree

        5
      /   \
     3     8
    / \   / \
   2   4 6   10

#include <iostream>
#include <algorithm> // Include the algorithm library for max function

// Define a node structure for the Binary Tree
struct Node {
    int data;
    Node* left;
    Node* right;

    Node(int value) {
        data = value;
        left = nullptr;
        right = nullptr;
    }
};

// Function to find the maximum value in Binary Tree
int findMax(Node* root) {
    if (root == nullptr)
        return INT_MIN; // Initialize with smallest possible value

    // Recursively find the maximum value in left and right subtrees
    int leftMax = findMax(root->left);
    int rightMax = findMax(root->right);

    // Return the maximum of current node's value, left subtree's maximum, and right subtree's maximum
    return std::max(root->data, std::max(leftMax, rightMax));
}

int main() {
    // Creating the Binary Tree
    Node* root = new Node(5);
    root->left = new Node(3);
    root->right = new Node(8);
    root->left->left = new Node(2);
    root->left->right = new Node(4);
    root->right->left = new Node(6);
    root->right->right = new Node(10);

    // Find and print the maximum value in the Binary Tree
    int maxValue = findMax(root);
    std::cout << "Maximum value in Binary Tree: " << maxValue << std::endl;

    return 0;
}

Maximum value in Binary Tree: 10