unsorted array to bst

1#include<iostream>
2using namespace std;
3typedef struct node
4{
5    int value;
6    node * pLeft;
7    node * pRight;
8    node(int val = 0)
9    {
10        value = val;
11        pRight = NULL;
12        pLeft = NULL;
13    }
14}node;
15 
16void insert(node ** pRoot, int val)
17{
18    if(*pRoot == NULL)
19        *pRoot = new node(val);
20    else if((*pRoot)->value <= val)
21        insert(&((*pRoot)->pRight), val);
22    else if((*pRoot)->value > val)
23        insert(&((*pRoot)->pLeft), val);
24}
25 
26node * getBST(int * arr, int size)
27{
28    node * pRoot = NULL;
29    for(int i = 0; i < size; i++)
30        insert(&pRoot, arr[i]);
31    return pRoot;
32}
33 
34void inOrderTraversal(node * pRoot)
35{
36    if(pRoot && pRoot->pLeft)
37        inOrderTraversal(pRoot->pLeft);
38    if(pRoot)
39        std::cout<<pRoot->value<<" , ";
40    if(pRoot && pRoot->pRight)
41        inOrderTraversal(pRoot->pRight);
42 
43}
44int main()
45{
46    int arr[] = {10,5,15,5,6,7,8,89};
47    node * pRoot = getBST(arr, sizeof(arr)/sizeof(int));
48    inOrderTraversal(pRoot);
49    std::cout<<std::endl;
50    return 0;
51}