#include <iostream>
struct TreeNode {
int data;
TreeNode* left;
TreeNode* right;
TreeNode(int value) : data(value), left(nullptr), right(nullptr) {}
};
void insertNode(TreeNode*& root, int value) {
if (root == nullptr) {
root = new TreeNode(value);
return;
}
if (value < root->data) {
insertNode(root->left, value);
} else {
insertNode(root->right, value);
}
}
int main() {
TreeNode* root = nullptr;
// Insert nodes into the tree
insertNode(root, 5);
insertNode(root, 3);
insertNode(root, 7);
insertNode(root, 1);
insertNode(root, 4);
// Perform operations with the tree as needed
return 0;
}