#include <iostream>
#include <vector>
using namespace std;
struct Node {
int data;
Node* left;
Node* right;
};
Node* createNode(int data) {
Node* node;
node->data = data;
node->left = node->right = nullptr;
return node;
}
void addNode(Node* root, int data) {
if (root == nullptr)
root = createNode(data);
if (root->data > data) addNode(root->left, data);
if (root->data < data) addNode(root->right, data);
}
Node* buildSearchTree(vector<int> nodes) {
Node* root;
for (int i = 0; i < nodes.size(); i++)
addNode(root, nodes[i]);
return root;
}
int main() {
vector<int> numbers;
numbers.push_back(5);
numbers.push_back(7);
numbers.push_back(2);
numbers.push_back(19);
numbers.push_back(51);
numbers.push_back(6);
numbers.push_back(25);
Node* root = buildSearchTree(numbers);
return 0;
}
