1.4) Find the Floor of given value in BST

#include <iostream>
using namespace std;

class TreeNode {
public:
    int data;
    TreeNode* left;
    TreeNode* right;

    TreeNode(int val) {
        data = val;
        left = nullptr;
        right = nullptr;
    }
};

class BST {
private:
    TreeNode* root;

    int floorRecursive(TreeNode* root, int val) {
        if (root == nullptr) {
            return -1;  // No floor value found
        }

        if (root->data == val) {
            return val;  // The current node's value is the floor
        } else if (root->data > val) {
            return floorRecursive(root->left, val);  // Search in the left subtree
        }

        // The potential floor value is in the right subtree
        int floorValue = floorRecursive(root->right, val);
        return (floorValue <= val && floorValue != -1) ? floorValue : root->data;
    }

public:
    BST() {
        root = nullptr;
    }

    // Other functions like insert and remove go here

    int floor(int val) {
        return floorRecursive(root, val);
    }
};

int main() {
    BST bst;

    bst.insert(15);
    bst.insert(8);
    bst.insert(20);
    bst.insert(12);
    bst.insert(25);

    int floorValue = bst.floor(16);  // Finding the floor of 16
    if (floorValue != -1) {
        cout << "Floor of 16 is: " << floorValue << endl;
    } else {
        cout << "No floor value found." << endl;
    }

    return 0;
}